Good code is its own best documentation. As you are about to add a comment, ask yourself, How can I improve the code so that this comment isn't needed? Improve the code and then document it to make it even clearer. Steve McConnell

Dijkstas algorithm

Language Java | Level Intermediate | Category Algorithms | August 5, 2015 8:04 am

Algorithm Problem Description

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]



Please login to add comments.