#self doubt #minimum spanning tree

Question

T/F

In a graph G=(V,E) suppose that each edge e ∊ E has an integer weight w(e) such that 1<= W(e) <=n Then there is a an o(mlogn) time algorithm to find a minimum spanning tree in G.

Also,Does this "weight w(e) such that 1<= W(e) <=n"  has significance on time complexity or we consider it as some edges weights and proceed?

Comments

what is m here?

Answer 1

TRUE,

O(|W| + |E| + |V|Log|V|) OR O(|W| + |E| + |E|Log|V|)

 

(CLRS)