Congratulations on reaching the final task in Data Structures and Algorithms! While I still have your attention, I would like to get your help planning my holiday over the winter break.

I am planning on touring Australia in an electric car. I want to plan the route so that the distance between charging stations along the route is less than the distance the car can go on a single charge. Let us imagine a graph where the vertices are charging stations, and the weight of an edge between two charging stations is the road distance between them. A trip from Sydney to Brisbane, for example, could make stops for recharging at Newcastle, Taree, Coffs Harbour, Byron Bay, Gold Coast, and finally Brisbane. In this picture we show these stops together with the distance in kilometre$\}$s between them.