Compute MST for the following algorithms (a) Prim's algorithm (b) Dijkistra's algorithm (Source a) (c) Kruskal's...

Transcribed Image Text:

Compute MST for the following algorithms (a) Prim's algorithm (b) Dijkistra's algorithm (Source a) (c) Kruskal's algorithm C 4 g 5 2 6 3 a 4 d h k 5 7 3 1 6 8 b e i 3 4 5 T 2 3 6 9 f 5 Compute MST for the following algorithms (a) Prim's algorithm (b) Dijkistra's algorithm (Source a) (c) Kruskal's algorithm C 4 g 5 2 6 3 a 4 d h k 5 7 3 1 6 8 b e i 3 4 5 T 2 3 6 9 f 5

Answer rating: 100% (QA)

a Prims algorithm starts at a random nodevertex to initialise the minimum spanning tree MST Then it finds the edges that connect the tree to new vertices From those edges we find the minimumweight edg... View the full answer