Question: (a) Find a minimum spanning tree in the given graph using Kruskal's algorithm. List the edges in the order in which they are added,
(a) Find a minimum spanning tree in the given graph using Kruskal's algorithm. List the edges in the order in which they are added, and draw the minimum spanning tree. (b) Find a minimum spanning tree in the given graph using Prim's algorithm (rooted at any vertex of your choosing). List the edges in the order in which they are added, and draw the minimum. spanning tree. (c) Using Dijkstra's algorithm, compute the tree of shortest paths, rooted at vertex A. Draw this shortest paths tree. A 5 16 9 3 2 D
Step by Step Solution
3.52 Rating (155 Votes )
There are 3 Steps involved in it
1 For creating a minimum spanning tree using Kruskals algorithm we pick minimum edge weights and add into the minimum spanning tree until a cycle is formed In case a cycle is formed we just drop that ... View full answer
Get step-by-step solutions from verified subject matter experts
