Keywords
Brute Force Algorithm
How to Cite
Abstract
Most of the people love to travel around places that have good scenery and exciting activities. Pangasinan has many tourist attractions that can be visited. There is always a need to plan your expenses. Travelling requires consuming time and money. This study will help to minimize your expenses by finding the optimum Hamilton circuit. The study will find an optimal route in the graph with top tourist spots in Pangasinan will be the vertices to be visited.
In this research, the weighted graph of the top tourist spot in Pangasinan will be given finding its Hamilton circuit. On the list of the top tourist spots in Pangasinan the Veteran’s Park in Lingayen one, Lucap Wharf in Alaminos, Wonderful Cave in Bolinao, Minor Basilica of Our Lady of the Rosary of Manaoag and Balungao Hilltop Adventure. The combinations of the tourist spots should be arranged to count the number of possible circuits. The Brute Force Algorithm, using its methods, finding the optimal solution is possible. Through this, it was found out that Brute Force is the best method to use and the best circuit to follow to optimize the expenses.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.