The algorithm was invented in 1956 by Edsger W. Dijkstra, a computer scientist tasked to demonstrate the capabilities of the ARMAC computer while working at the Mathematical Center in Amsterdam.
Shortest path Dijkstra was the first algorithm implemented in pgRouting; pgRouting was called pgDijkstra in its early days.
The algorithm can be used by calling a pgr_dijkstra function. It has a few different signatures that let one calculate paths in the following modes:
- One-to-one: One source node to one target node
- One-to-many: One source node to many target nodes
- Many-to-one: Many source nodes to one target node
- Many-to-many: Many source nodes to many targets
All the methods can be used for either directed or non-directed ...
