A cut (S, V − S) of an undirected
graph G = (V,E) is a partition of V .
An edge (u, v) ∈ E crosses the cut iff one of
its endpoints is in S and the other is in V −S.
An edge is a light edge crossing a cut if its
weight is the minimum of any edge crossing
the cut.
Please give me an algorithm for this problem---
Show that if an edge(u,v)is contained in some MST, then it is a light
edge crossing some cut of the graph.
i need a solution very urgently...
plz help..
--~--~-~--~~~---~--~~
You received this message because you
Can anyone please solve any of the following problems? I need a
detailed solution. It is my data structure assignment, and i have to
submit it by the 4th of april. Please someone help me... its urgent.
Show that if an edge(u,v)is contained in some MST, then it is a light
edge crossing some cut
