Networks, STD2 N2 SM-Bank 5 A network of roads is pictured below, with the distances of each road represented, in kilometres, on each edge. A driver wants to travel from A to H in the shortest distance possible. Describe the possible paths she can take, and the total distance she must travel. (2 marks) Show Answers Only `text(Shortest distance paths:)` `text(A - E - H or A - F - G - H)` `text(Shortest distance is 11 km.)` Show Worked Solution `text(One Strategy: Dijkstra's algorithm)` `text(Shortest distance paths:)` `text(A - E - H or A - F - G - H)` `text(Shortest distance is 11 km.)`