those two statement are equivalent, right ?

The Gateway to Computer Science Excellence

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 ??

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

yup

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

what's that mean ?

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

what's that mean ?

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,645 questions

56,596 answers

195,824 comments

102,083 users