1. Find the shortest paths from node 1 to all other nodes by Dijkstra's algorithm. 5 1 2 7 3 10 1 4 4 3 5 3 6 11 7 5 7 2 8 0 9 1 12 10 2 11 4 12
BAC
San222ad
Question
1. Find the shortest paths from node 1 to all other nodes by Dijkstra's algorithm.
5
1
2
7
3
10
1
4
4
3
5
3
6
11
7
5
7
2
8
0
9
1
12
10
2
11
4
12
5
1
2
7
3
10
1
4
4
3
5
3
6
11
7
5
7
2
8
0
9
1
12
10
2
11
4
12