Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.
python src/djikstra.py examples/graph1.wug
Examples:
Graph 1
(origin) (destiny)
1 5
(node) (node) (distance)
1 2 7
1 6 14
1 3 9
2 3 10
2 4 15
3 4 11
3 6 2
4 5 6
6 5 5
Graph 2
(origin) (destiny)
1 6
(node) (node) (distance)
1 2 5
1 3 2
2 4 4
2 5 2
3 2 8
3 5 7
4 6 3
4 5 6
5 6 1
Graph 3
(origin) (destiny)
1 8
(node) (node) (distance)
1 2 2
1 4 4
2 4 1
2 3 6
3 7 5
4 6 9
4 5 11
5 3 2
5 8 7
6 8 2
7 8 3
MIT License. Click here for more information.