Scribd
Upload
32 views13 pages

Dijkstra Solutions

The document shows the iterations of Dijkstra's algorithm to find the shortest paths between nodes in a graph. Over 11 iterations, it calculates the distances and routes between each node, and marks them as permanent once the shortest path is found. It eventually finds the shortest path between each of the 11 nodes.

Uploaded by

leibuto ozama
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views13 pages

Dijkstra Solutions

The document shows the iterations of Dijkstra's algorithm to find the shortest paths between nodes in a graph. Over 11 iterations, it calculates the distances and routes between each node, and marks them as permanent once the shortest path is found. It eventually finds the shortest path between each of the 11 nodes.

Uploaded by

leibuto ozama
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

SHORTEST ROUTES -- DIJKSTRA'S ITERATIONS

Title: 2414
Node Label Status
Iteration 1
1 [0.00, --] permanent
2 [2.00, 1] temporary
3 [4.00, 1] temporary
4 [10.00, 1] temporary
5
6
7
Iteration 2
1 [0.00, --] permanent
2 [2.00, 1] permanent
3 [4.00, 1] temporary
4 [10.00, 1] temporary
5 [7.00, 2] temporary
6
7
Iteration 3
1 [0.00, --] permanent
2 [2.00, 1] permanent
3 [4.00, 1] permanent
4 [7.00, 3] temporary
5 [7.00, 2] temporary
6 [5.00, 3] temporary
7
Iteration 4
1 [0.00, --] permanent
2 [2.00, 1] permanent
3 [4.00, 1] permanent
4 [7.00, 3] temporary
5 [7.00, 2] temporary
6 [5.00, 3] permanent
7 [14.00, 6] temporary
Iteration 5
1 [0.00, --] permanent
2 [2.00, 1] permanent
3 [4.00, 1] permanent
4 [7.00, 3] permanent
5 [7.00, 2] temporary
6 [5.00, 3] permanent
7 [14.00, 6] temporary
Iteration 6
1 [0.00, --] permanent
2 [2.00, 1] permanent
3 [4.00, 1] permanent
4 [7.00, 3] permanent
5 [7.00, 2] permanent
6 [5.00, 3] permanent
7 [13.00, 5] temporary
Iteration 7
1 [0.00, --] permanent
2 [2.00, 1] permanent
3 [4.00, 1] permanent
4 [7.00, 3] permanent
5 [7.00, 2] permanent
6 [5.00, 3] permanent
7 [13.00, 5] permanent
SHORTEST ROUTES -- DIJKSTRA'S OUTPUT SUMMARY

Title: 2414
Node Distance Route

1 0.00 --
2 2.00 1-2
3 4.00 1-3
4 7.00 1-3-4
5 7.00 1-2-5
6 5.00 1-3-6
7 13.00 1-2-5-7
SHORTEST ROUTES -- DIJKSTRA'S ITERATIONS

Title: 2416
Node Label Status
Iteration 1
1 [0.00, --] permanent
2 [5.00, 1] temporary
3 [3.00, 1] temporary
4
5
6
7
Iteration 2
1 [0.00, --] permanent
2 [4.00, 3] temporary
3 [3.00, 1] permanent
4 [10.00, 3] temporary
5
6
7 [15.00, 3] temporary
Iteration 3
1 [0.00, --] permanent
2 [4.00, 3] permanent
3 [3.00, 1] permanent
4 [9.00, 2] temporary
5 [6.00, 2] temporary
6
7 [15.00, 3] temporary
Iteration 4
1 [0.00, --] permanent
2 [4.00, 3] permanent
3 [3.00, 1] permanent
4 [9.00, 2] temporary
5 [6.00, 2] permanent
6 [7.00, 5] temporary
7 [12.00, 5] temporary
Iteration 5
1 [0.00, --] permanent
2 [4.00, 3] permanent
3 [3.00, 1] permanent
4 [9.00, 2] temporary
5 [6.00, 2] permanent
6 [7.00, 5] permanent
7 [11.00, 6] temporary
Iteration 6
1 [0.00, --] permanent
2 [4.00, 3] permanent
3 [3.00, 1] permanent
4 [9.00, 2] permanent
5 [6.00, 2] permanent
6 [7.00, 5] permanent
7 [11.00, 6] temporary
Iteration 7
1 [0.00, --] permanent
2 [4.00, 3] permanent
3 [3.00, 1] permanent
4 [9.00, 2] permanent
5 [6.00, 2] permanent
6 [7.00, 5] permanent
7 [11.00, 6] permanent
SHORTEST ROUTES -- DIJKSTRA'S OUTPUT SUMMARY

Title: 2416
Node Distance Route

1 0.00 --
2 4.00 1-3-2
3 3.00 1-3
4 9.00 1-3-2-4
5 6.00 1-3-2-5
6 7.00 1-3-2-5-6
7 11.00 1-3-2-5-6-7
SHORTEST ROUTES -- DIJKSTRA'S ITERATIONS

Title: 2419
Node Label Status
Iteration 1
1-O [0.00, --] permanent
2-A [4.00, 1] temporary
3-B [3.00, 1] temporary
4-C [6.00, 1] temporary
5-D
6-E
7-F
8-G
9-H
10-I
11-T
Iteration 2
1-O [0.00, --] permanent
2-A [4.00, 1] temporary
3-B [3.00, 1] permanent
4-C [6.00, 1] temporary
5-D
6-E [9.00, 3] temporary
7-F
8-G
9-H
10-I
11-T
Iteration 3
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] temporary
5-D [7.00, 2] temporary
6-E [9.00, 3] temporary
7-F
8-G
9-H
10-I
11-T
Iteration 4
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] temporary
6-E [9.00, 3] temporary
7-F [8.00, 4] temporary
8-G
9-H
10-I
11-T
Iteration 5
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] temporary
7-F [8.00, 4] temporary
8-G [11.00, 5] temporary
9-H
10-I
11-T
Iteration 6
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] temporary
7-F [8.00, 4] permanent
8-G [10.00, 7] temporary
9-H [13.00, 7] temporary
10-I
11-T
Iteration 7
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] permanent
7-F [8.00, 4] permanent
8-G [10.00, 7] temporary
9-H [11.00, 6] temporary
10-I [14.00, 6] temporary
11-T
Iteration 8
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] permanent
7-F [8.00, 4] permanent
8-G [10.00, 7] permanent
9-H [11.00, 6] temporary
10-I [14.00, 6] temporary
11-T [17.00, 8] temporary
Iteration 9
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] permanent
7-F [8.00, 4] permanent
8-G [10.00, 7] permanent
9-H [11.00, 6] permanent
10-I [14.00, 6] temporary
11-T [17.00, 8] temporary
Iteration 10
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] permanent
7-F [8.00, 4] permanent
8-G [10.00, 7] permanent
9-H [11.00, 6] permanent
10-I [14.00, 6] permanent
11-T [17.00, 8] temporary
Iteration 11
1-O [0.00, --] permanent
2-A [4.00, 1] permanent
3-B [3.00, 1] permanent
4-C [6.00, 1] permanent
5-D [7.00, 2] permanent
6-E [9.00, 3] permanent
7-F [8.00, 4] permanent
8-G [10.00, 7] permanent
9-H [11.00, 6] permanent
10-I [14.00, 6] permanent
11-T [17.00, 8] permanent
SHORTEST ROUTES -- DIJKSTRA'S OUTPUT SUMMARY

Title: 2419
Node Distance Route

1 0.00 --
2 4.00 1-2
3 3.00 1-3
4 6.00 1-4
5 7.00 1-2-5
6 9.00 1-3-6
7 8.00 1-4-7
8 10.00 1-4-7-8
9 11.00 1-3-6-9
10 14.00 1 - 3 - 6 - 10
11 17.00 1 - 4 - 7 - 8 - 11
SHORTEST ROUTES -- DIJKSTRA'S ITERATIONS

Title: 2420
Node Label Status
Iteration 1
1 [0.00, --] permanent
2 [5.00, 1] temporary
3 [1.00, 1] temporary
4
5
6
7
Iteration 2
1 [0.00, --] permanent
2 [3.00, 3] temporary
3 [1.00, 1] permanent
4 [7.00, 3] temporary
5 [8.00, 3] temporary
6
7
Iteration 3
1 [0.00, --] permanent
2 [3.00, 3] permanent
3 [1.00, 1] permanent
4 [7.00, 3] temporary
5 [4.00, 2] temporary
6 [9.00, 2] temporary
7
Iteration 4
1 [0.00, --] permanent
2 [3.00, 3] permanent
3 [1.00, 1] permanent
4 [7.00, 3] temporary
5 [4.00, 2] permanent
6 [9.00, 2] temporary
7 [13.00, 5] temporary
Iteration 5
1 [0.00, --] permanent
2 [3.00, 3] permanent
3 [1.00, 1] permanent
4 [7.00, 3] permanent
5 [4.00, 2] permanent
6 [9.00, 2] temporary
7 [13.00, 5] temporary
Iteration 6
1 [0.00, --] permanent
2 [3.00, 3] permanent
3 [1.00, 1] permanent
4 [7.00, 3] permanent
5 [4.00, 2] permanent
6 [9.00, 2] permanent
7 [11.00, 6] temporary
Iteration 7
1 [0.00, --] permanent
2 [3.00, 3] permanent
3 [1.00, 1] permanent
4 [7.00, 3] permanent
5 [4.00, 2] permanent
6 [9.00, 2] permanent
7 [11.00, 6] permanent
SHORTEST ROUTES -- DIJKSTRA'S OUTPUT SUMMARY

Title: 2420
Node Distance Route

1 0.00 --
2 3.00 1-3-2
3 1.00 1-3
4 7.00 1-3-4
5 4.00 1-3-2-5
6 9.00 1-3-2-6
7 11.00 1-3-2-6-7

You might also like