06000CS309122001

1. graph G has no minimum spanning tree

Il. Graph G has unique MST of cost 2-1
111. Graph Ghas multiple distinct MSTs, each of cost 1-1
IV. Graph G has multiple spanning trees of different costs

19 Write Dijkstra's shortest path algorithm. Apply this algorithm to find the (10)

shortest paths from vertex A to all other vertices.

20 Write Kruskal’s algorithm for minimum spanning tree (MST). Apply this (10)
algorithm to find a MST of the below graph.

ERE

Page 5 of 5