Data Structure (2130702)

BE | Semester-3   Summer-2016 | 06/09/2016

Q5) (c) 

Write Prim’s algorithm for minimum spanning tree with an example.

Using Prim’s Algorithm:
Let X be the set of nodes explored, initially X = { A }
 
 
 
 
 
 
 
 
 

Questions

Go to Question Paper