Consider the network shown below (note that edges are directed).

Calculate the shortest paths to all nodes from source node A using Dijkstras algorithm. Record your solutions through the next few questions.

Note:

- When choosing the node to explore next, if there is more than one node that has the shortest known path so far, choose the node which is alphabetically earlier first.

- A few entries for Iteration 1 (i.e., row 1) have already been filled in for you. Use a similar format for the remaining answers.

Iteration 7 (Row 7)

Node being explored:

Shortest known distance from A to A: From: Finalized:

Shortest known distance from A to B: From: Finalized:

Shortest known distance from A to C: From: Finalized:

Shortest known distance from A to D: From: Finalized:

Shortest known distance from A to E: From: Finalized:

Shortest known distance from A to F: From: Finalized:

Shortest known distance from A to G: From: Finalized:

Shortest known distance from A to H: From: Finalized:

Iteration 8 (Row 8)

Node being explored:

Shortest known distance from A to A: From: Finalized:

Shortest known distance from A to B: From: Finalized:

Shortest known distance from A to C: From: Finalized:

Shortest known distance from A to D: From: Finalized:

Shortest known distance from A to E: From: Finalized:

Shortest known distance from A to F: From: Finalized:

Shortest known distance from A to G: From: Finalized:

Shortest known distance from A to H: From: Finalized:

7 5 2 6 5 6 2 3 3