3. [15 points] Find a minimum weight spanning tree using Prim's algorithm. Start at vertex 'a', Follow alphabetical orde

[answerhappygod]

3 15 Points Find A Minimum Weight Spanning Tree Using Prim S Algorithm Start At Vertex A Follow Alphabetical Orde 1 (92.1 KiB) Viewed 67 times

3. [15 points] Find a minimum weight spanning tree using Prim's algorithm. Start at vertex 'a', Follow alphabetical ordering when you visit the vertices within the list of adjacent vertices. Maintain key and predecessor information within vertex in the form [vertex, key, predecessor] and edge in the form [u, v, w] where the edge is between vertex u and v with weight w. Fill the below table. Draw the minimum spanning tree as final output, calculate the weight of minimum spanning tree. 19 7 a 13. Front vertex b 15 e 5 Next neighbor 25 22 10 d Priority Queue of vertices (front to back) [vertex, key, predecessor] A - set of edges in the minimum spanning tree. [u, v, w]