If Java had true garbage collection, most programs would delete themselves upon execution. Robert Sewell
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph.
Write a program to implement the Dijkstra Algorithm
Distance to Mumbai: 0.0 Path: [Mumbai] Distance to Chennai: 5.0 Path: [Mumbai, Chennai] Distance to Bangalore: 8.0 Path: [Mumbai, Chennai, Bangalore] Distance to Hyderabad: 8.0 Path: [Mumbai, Hyderabad] Distance to Coimbatore: 10.0 Path: [Mumbai, Hyderabad, Coimbatore]