Question

With the indicated link costs, use Dijkstra's shortest-path algorithm to compute the shortest path from F to all network nodes. Show how the algorithm works by filling in the table with the following columns (you may refer to the related lecture slide or the first question in homework 3): 1st col: Step 2nd col: N' 3rd col: D(A), p(A) 4th col: D(B), p(B) 5th col: D(C), p(C) 6th col: D(D), p(D) 7th col: D(E), p(E) 8th col: D(G), p(G) 9th col: D(H), p(H) Hints: you may need 7 steps. By referring to the resulting table you computed in the above question, draw the least-cost paths.

          With the indicated link costs, use Dijkstra's shortest-path algorithm to compute
the shortest path from F to all network nodes. Show how the algorithm works by filling in the
table with the following columns (you may refer to the related lecture slide or the first
question in homework 3):
1st col: Step
2nd col: N'
3rd col: D(A), p(A)
4th col: D(B), p(B)
5th col: D(C), p(C)
6th col: D(D), p(D)
7th col: D(E), p(E)
8th col: D(G), p(G)
9th col: D(H), p(H)
Hints: you may need 7 steps.
By referring to the resulting table you computed in the above question, draw
the least-cost paths.

With the indicated link costs, use Dijkstra's shortest-path algorithm to compute
the shortest path from F to all network nodes. Show how the algorithm works by filling in the
table with the following columns (you may refer to the related lecture slide or the first
question in homework 3):
1st col: Step
2nd col: N'
3rd col: D(A), p(A)
4th col: D(B), p(B)
5th col: D(C), p(C)
6th col: D(D), p(D)
7th col: D(E), p(E)
8th col: D(G), p(G)
9th col: D(H), p(H)
Hints: you may need 7 steps.
By referring to the resulting table you computed in the above question, draw
the least-cost paths.

Added by Luc-A B.

Question

Please give Ace some feedback