An Application of Minimum Spanning Trees to Travel Planning

Travel in Papua New Guinea is quite expensive compared to many of its neighbouring countries. On the other hand Papua New Guinea presents travelers with a tremendous array of sites and scenes that they would not find anywhere else in the world. This is the first of a series papers, resulting from collaboration between the departments of Tourism and Hospitality Management, and Mathematics and Computing Science at Divine Word University, on quantifying the issue of tourism in Papua New Guinea. In this paper we demonstrate the use of Prim’s algorithm in graph theory to determine less expensive routes between nodes in a connected graph. We suggest an application to determining cheap transport routes in the country.

Similar Posts: