Dijkstra’s shortest path algorithm
4
9
5
2
9
3
5
4
1
0
3
3
3
3
3
4
2
3
2
3
