3. Snippet (MST): Consider Graph given below to complete the code

[answerhappygod]

3. Snippet (MST): Consider Graph given below to complete thecode

3 Snippet Mst Consider Graph Given Below To Complete The Code 1 (24.73 KiB) Viewed 10 times

3 Snippet Mst Consider Graph Given Below To Complete The Code 2 (92.5 KiB) Viewed 10 times

3 Snippet Mst Consider Graph Given Below To Complete The Code 3 (57.12 KiB) Viewed 10 times

3 Snippet Mst Consider Graph Given Below To Complete The Code 4 (100.55 KiB) Viewed 10 times

3 Snippet Mst Consider Graph Given Below To Complete The Code 5 (25.96 KiB) Viewed 10 times

0 3 1 1 7 3 2 5 9 2 4 1
#include #include #define MAX 50 #define N 5 //number of Nodes #define S 0 //starting vertex void fixMatrix (int adjList [MAX] [MAX]) { } for (int i=0;i Weight\n"); printf("====▪▪▪▪▪▪▪▪▪▪=\n"); int cost=0; for (int i=0;i %d\n",v1, v2, adjList[v1] [v2]); //c. complete this line to compute total cost of MST (5) } printf("==============\n") ; printf("Total Cost: %d\n", cost); return 0;
Edges of MST: Edge => Weight 11 0 3 => 1 0 1 => 3 1 2 => 2 2 4 => 1 Total Cost: 7