Minimum Spanning tree tour route of 9 temples in Ayutthaya

Abstract

In the present day, most of Thai Buddhists are attaching to visiting temples for making merits and paying respect to Buddha for the auspiciousness. Visiting 9 temples in a trip is very popular; however, time spending for the trip can be a problem. The problem can be solved   with graphs theory as the minimum spanning tree problem. Khruskhal's algorithm is the most basic and popular technique for solving the problem of the minimum spanning tree. The researcher gathered all the paths connecting 9 temples in Pranakorn Si Ayuthaya and distances of each path and graphed them. The 9 temples are Phra Sri Sanphet, Phanapan Choeng Worawihan, Wat Wihan Phra Mongkhon Bophit, Wat Yai Chai Mongkol, Wat Kasattrathirat, Mahathat Temple, Chai Watthanaram, Ratchaburana and Phutthaisawan Temples. The Khruskhal's algorithm was then applied to the minimum spanning tree to find travel route with the shortest distance to complete the worship trip. It was found that travelling with the starting point at Wat Phanancheng Worawihan and travelling to Wat Yai Chai Mongkhon, Wat Ratchaburana, Wat Mahathat, Wat Phra Si Sanphet, Wihan Phra Mongkhon Bophit, Kasattrathirat, Chai Watthanaram, and to Phutthaisawan temples; in respective order, gave the shortest distance to complete visiting 9 temples in Phra Nakhon Si Ayutthaya province at 16.92 kilometers.