A simple Dijkstra Algorithm to find the shortest path between any two points in the undirected graph.
>= 0
Sriram V
