Applications, extensions, and alternatives

There are different applications and special cases where the Dijkstra algorithm can be applied. In addition to routing, the calculation of distances can also be used for other areas where the euclidian distance is not the basis, but time or cost is.

In addition to the weighting of the edges, weights to the node can also be specified. This could be of use when the process of changing within the node "main station" is associated with high costs. In this case, the node receives its own weight, which has to be taken into account while computing the shortest paths.

The Dijkstra algorithm does not work with negative edge weights. If you want to run a shortest path calculation with negative egde weights, other algorithms such as the Bellman-Ford-algorithm must be used.

The Dijkstra algorithm is not suitable for all applications or types of graphs. Other algorithms include the Kruskal or Borùvka which are used to compute minimum spanning trees in undirected graphs.