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.

Question 12 pts

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: 1

From: A

Finalized: No

Shortest known distance from A to C: inf

From: A

Finalized: No

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:

Flag this Question

Question 22 pts

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:

Flag this Question

Question 32 pts

Iteration 3 (Row 3)

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:

Flag this Question

Question 42 pts

Iteration 4 (Row 4)

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:

Flag this Question

Question 52 pts

Iteration 5 (Row 5)

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:

Flag this Question

Question 62 pts

Iteration 6 (Row 6)

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:

Flag this Question

Question 72 pts

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:

Flag this Question

Question 82 pts

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:

Summarize your final answers in the table below.

For the "Shortest path" column, specify each node in the path, in order of their occurrence within the path, separated by dashes (e.g., A-B-C). Do not include any spaces in your answers.

For the "Length of shortest path" column, use digits (e.g., 5) and not strings to represent the total length of the shortest path.

If no path exists to a given node, you entry in the "Shortest path" column must be "no path" and your entry in the "Length of shortest path" column must be inf.

The first row is filled in for you as a reference.

Nodes	Shortest path	Length of shortest path
A -> B	A-B	1
A -> C
A -> D
A -> E
A -> F
A -> G
A -> H