Dijkstra Shortest Path Algorithm

Complete the table after each step of the algorithm.

Challenge:

Weighted Directed Graph

Step 1

Select the correct status, shortest distance from A, and previous node for the current step. Use ∞ when a node has not yet been reached.

   -       -