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