# DOUBT ON MINIMAL SPANNING TREE

92 views
II.  if an edge (u,v) is contained in some minimum spanning tree, then it is a light edge crossing some cut of the graph.

III. If (u,v) is a light edge connecting CC(connected component) to some other component in the forest of graph G, then (u, v) is     included in the minimum spanning tree.

didn’t understand the part “light edge crossing some cut of the graph”

can someone explain me with the diagram ??
0
those two statement are equivalent, right ?
0
yup

but I couldn't  analyze the part  " it is a light edge crossing some cut of the graph."

what's that mean ?
2

" it is a light edge crossing some cut of the graph."

means, it is minimum weight edge among those edges which are in the connecting other component

in e1,e2,e3 we should include one edge in any case which is should having less weight

0

got it !

thanks @Shaik

## Related questions

1
318 views
How many numbers of spanning tree are possible?
Which algorithm will be implemented on the weighted graph in which the edges are uniformly distributed over the half-open interval $[0,1)$ to construct MST so that it runs in linear time? $A)$ Kruskal's algorithm $B)$ Prim's algorithm $C)$ Both $(A)$ and $(B)$ $D)$ None of these