Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex a. Show the order in which the edges are added to the tree.

What is the minimum weight spanning tree for the weighted graph in the previous question subject to the condition that edge {d,e} is in the spanning tree?

How would you generalize this idea. Suppose you are given a graph G and a particular edge {u,v} in the graph. How would you alter Prim's algorithm to find the minimum spanning tree subject to the condition that {u,v} is in the tree 

Transcribed Image Text:

f 2 5 3 e C 2 7 5 a 6 b f 2 5 3 e C 2 7 5 a 6 b

Answer rating: 100% (QA)

Please find t... View the full answer