Dijkstra Algorithm

A common application in the field of network analysis is the calculation of shortest paths. There are various algorithms available to solve this problem. A very common algorithm for calculating the shortest distance between two nodes in a network is the Dijkstra algorithm. It is used in edge-weighted graphs, and calls exclusively for positive values used in the weights.

In this unit, we will explain the functionality of the Dijkstra algorithm. We present the pseudocode for the implementation of the algorithm. The principles of the algorithm are shown with the help of an animation.