As soon as we started programming, we found to our surprise that it wasn’t as easy to get programs right as we had thought. Debugging had to be discovered. I can remember the exact instant when I realized that a large part of my life from then on was going to be spent in finding mistakes in my own programs. Maurice Wilkes
Dijkstras algorithm is an algorithm for finding the shortest paths between nodes in a graph. Dijkstra's Algorithm solves the single-source shortest path problem in weighted graphs. It is similar to Prims algorithm. Dijkstra algorithm can be used for graphs with all positive weight edges only. Dijkstra is not lacks distribute property.
Write a program to implement Dijkstra's algorithm
Distance to Delhi: 0.0 Path: [Delhi] Distance to Mumbai: 5.0 Path: [Delhi, Mumbai] Distance to chennai: 8.0 Path: [Delhi, Mumbai, chennai] Distance to Bangalore: 8.0 Path: [Delhi, Bangalore] Distance to Pune: 10.0 Path: [Delhi, Bangalore, Pune]