Question

Consider the following undirected, weighted graph: G 3 4 5 B D 2 3 1 A 2 2 F 2 3 9 9 C E 8 Step through Dijkstra's algorithm to calculate the single-source shortest paths from A to every other vertex. Show your steps in the table below. Cross out old values and write in new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices in the order which you marked them known. a) Vertex A B C D E F G Known Cost Path b) Finally, indicate the lowest-cast path from node A to node F.

          Consider the following undirected, weighted graph:
G
3
4
5
B
D
2
3
1
A
2
2
F
2
3
9
9
C
E
8
Step through Dijkstra's algorithm to calculate the single-source shortest paths from A to
every other vertex. Show your steps in the table below. Cross out old values and write in
new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices
in the order which you marked them known.
a)
Vertex
A
B
C
D
E
F
G
Known
Cost
Path
b) Finally, indicate the lowest-cast path from node A to node F.

Consider the following undirected, weighted graph:
G
3
4
5
B
D
2
3
1
A
2
2
F
2
3
9
9
C
E
8
Step through Dijkstra's algorithm to calculate the single-source shortest paths from A to
every other vertex. Show your steps in the table below. Cross out old values and write in
new ones, from left to right within each cell, as the algorithm proceeds. Also list the vertices
in the order which you marked them known.
a)
Vertex
A
B
C
D
E
F
G
Known
Cost
Path
b) Finally, indicate the lowest-cast path from node A to node F.

Added by Felipe O.

Question

Please give Ace some feedback