Design and Analysis of Algorithms - Old Questions
6. Explain the Kruskal’s algorithm for computing spanning tree of weighted connected graph with an example of seven nodes graph.
8 marks
|
Asked in 2075