COS2611 - May/June 2014 - Question 8b

My interpretation of Question 8b for COS2611 - May/June 2014 - Dijkstra shortest path algorithm

[jackyharry]

Thanks for the effort, but there is clearly a mistake with the memo. There is a path from Node 2 to Node 1 with value 1 in the question, but this path is ignored in the memo. And I see you done the same in your explanation. The shortest path from Node 0 to Node 1 should be 3 (2+1) via Node 2. The memo has this as 5, which is incorrect.