Graphs II: Basic Algorithms :

Print this page

Problems

1. Trace the Kurskal's algorithm on the following graph to find the MST. Show the partially constructed MST at each stage.

   
     
 

2. Implement the Kurskal's algorithms using set data structure.
3. Prove or disprove the statement "The MST of a graph is unique".

     
     
Prev
Next