Solutions of Theory of Algorithms assignment23.1-3

Solutions of Theory of Algorithms assignment23.1-3 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms assignment 2 Exercise 23.1-3 If there exists a MST T, it must contain all nodes in the graph including u and v. And the edge (u, v) that belongs to T must have minimum weight among the other edges;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: otherwise it will not be selected to be part of the MST. Also, the edge (u, v) will trivially cross a cut. Satisfying both properties, edge (u, v) is a light edge....
View Full Document

Ask a homework question - tutors are online