504 views
0 votes
0 votes
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 ??

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
Amit puri asked Aug 25, 2016
813 views
Consider the following graph:The maximum possible weight that a minimum weight spanning tree of G can have isis the answer 25
0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Nov 8, 2018
1,035 views
How many numbers of spanning tree are possible?