Question

Can you explain spanning trees in few words.Can you think of other considerations to build road network connecting these cities?​

Answer 1

Answer:

Example. Using Prim's algorithm, we can start from any vertex, let us start from vertex 1. Vertex 3 is connected to vertex 1 with minimum edge cost, hence edge (1, 2) is added to the spanning tree. Next, edge (2, 3) is considered as this is the minimum among edges {(1, 2), (2, 3), (3, 4), (3, 7)}