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 1

Node being explored: A

Shortest known distance from A to A: 0

From: A

Finalized: Yes

Shortest known distance from A to B: 6

From: A

Finalized: No

Shortest known distance from A to C: inf

From: A

Finalized: No

Shortest known distance from A to D: 5

From: A

Finalized: No

Shortest known distance from A to E: 6

From: A

Finalized: No

Shortest known distance from A to F: 17

From: A

Finalized: No? - Would this be no or yes?

Shortest known distance from A to G: 10

From: A

Finalized: No

Shortest known distance from A to H: 8

From: A

Finalized: No

Please solve the problem below. Thank you in advance!

Iteration 2 (Row 2)

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