Description
Exercise 12: Implementation of Dijkstra algorithm to find shortest Path from the
given source vertex to all the other vertices of the graph
GRAPH:1
GRAPH : 2
(i) Represent the graphs using adjacency matrix or adjacency list.
(ii) Implement Dijkstra algorithm to find shortest path from source vertex to all
other vertices (Source: ‘V1’ – Graph 1 and ‘1’ – Graph 2)