4. Consider the following undirected, weighted graph (seen previously in #3): (12 points) 2 12 7 (в B D 5 2 F 3 3 3 E 10

[answerhappygod]

1 (46.98 KiB) Viewed 66 times

4. Consider the following undirected, weighted graph (seen previously in #3): (12 points) 2 12 7 (в B D 5 2 F 3 3 3 E 10 Step through Prim's algorithm to calculate a minimum spanning tree, starting from vertex A. Show the edge coordinates and their corresponding weights. Specify the weight of the MST and also draw the MST. Order vertices marked as known (done): 1) Neighbors of A Edges Weight