(Solved) : Paul Lives Mt Wellington Auckland Decided See Home Country New Zealand Decided Wants Visit Q31072534 . . .
Paul (who lives in Mt. Wellington, Auckland) has decided to see some more of his home country of New Zealand, and has decided that he wants to visit the cities of Wellington, Christchurch, Dunedin and Queenstown. However, before he leaves Auckland he needs to get to the airport (in Mangere). There are several routes that he could take that would take him through different suburbs. The table below shows the driving time (in minutes) between the different suburbs from his house. You may assume that the network is symmetric Mt. Wellington From/To Mt. Wellington (MW) Howick (H) Manukau (MK) Onehunga (O) Mangere (Man) Howick (H) Manukau (MK) Onehunga (O Mangere (Man) 12 16 24 19 a) Explain briefly why Dijkstra’s algorithm can be used to find a solution to this problem. b) Use Dijkstra’s algorithm by hand to find the shortest path from Mt. Wellington to the Airport. Do this on the network diagram given on the final page. Show all vour label updates on the diagram by crossing out any labels that are updated c) State the shortest route and the time required to drive this route. d) When Paul arrives back at the airport on the return journey, and heads for home, what is the route that he would take to get home in the shortest time possible? What is the total time needed to drive the route? What relationship does this have to the answer found in (b)? Why? Show transcribed image text
Expert Answer
Answer to Paul Lives Mt Wellington Auckland Decided See Home Country New Zealand Decided Wants Visit Q31072534 . . .
OR