Design and Analysis of Algorithms - Old Questions
7. Describe the prism’s algorithm for finding the maximum spanning tree of a graph. Also trace the algorithm for a weighted connected graph with at least 7 vertices.
8 marks
|
Asked in 2074