Question $6$

Considering the network below, calculate the shortest paths to all nodes from source node A using Dijkstra's algorithm.

In choosing the node to explore next, if there is more than one candidate, choose the one alphabetically earlier first.

A few entries for Iteration $1$ are filled out. Use a similar format for your answers.

For each iteration:

"Distance" means the shortest known distance from the source node A to this particular node.

"From" means the preceding node of this particular node in the shortest known distance path.

"Finalized?" means is the shortest distance path from the source node to this particular node finalized?

Iteration $1$

Node being explored: $A$