Consider a weighted graph G with 7 vertices (rows and columns are in the order V1,V2,V3,V4,V5,V6,V7), which is represented by the following adjacency matrix:
024003602824003200000000412032088003600000000400200280120000
Suppose we perform Prim's algorithm on the graph G starting from vertex V1 to find an MCST. Then the order in which the vertices are added is
Q11
1 Sep 2024
Mathematics 1 · Week 11
Q11.Suppose we perform Prim's algorithm on the graph G starting from vertex V1 to find an MCST. Then the order in which the vertices are added is@passage