Activity $2($Portfolio Task$)$:

Apply Dijkstra's algorithm on the following graph, starting from node $\text{'}A\text{'}$:

Include in your answer the following:

A figure depicting the final graph $($i$.$e$.$ after all nodes have been added to

the "cloud" while highlighting shortest paths$).$ Note: intermediate graphs

are not requirednode is added to the "cloud" as well as their corresponding updates in the

priority queue $($i$.$e$.$ removeMin and replaceKey$)$

Discuss your progress with your Tutor during practical sessions.

What to include in your Portfolio:

Report $-$ Activity $2$: Include in your report a figure depicting the final graph

$($i$.$e$.$ after all nodes have been added to the "cloud" while highlighting

shortest paths$).$ In addition, include computations describing the relaxation

of neighbouring nodes after each node is added to the "cloud" as well as

their corresponding updates in the priority queue $($i$.$e$.$ removeMin and

replaceKey$)$