Utilisation of the Dijkstra Algorithm to Determine the Shortest Path on Universiti Malaysia Sabah's Main Campus in Kota Kinabalu
Masitha Raziah Binti Henri, Shaliza Hayati A. Wahab, Salmah Binti Fattah, Nordin Saad, Nur Athirah Maisarah Binti Tambrin, Nur Farah Izzati Binti Jamaluddin, Sherlyn Ong Shu Shien, Zarra Soffea Binti Ghazalie · 2024
The purpose of this research is to determine the shortest path in the Universiti Malaysia Sabah main campus using the Dijkstra algorithm. It is to determine the paths from selected locations to different locations. The buildings in the institution were illustrated in the form of a graph, where the nodes are selected locations or faculties, while the edges are the paths, and their cost indicates the length. Besides, in this research, Matlab software is used to resolve the routes. The purpose of this software is to create a graph and discover the locations of the routes. Designing maps from optimal routes and the proposed routes is a complicated problem that can be solved by putting in the Dijkstra algorithm. The implementation of the Dijkstra algorithm in searching for the optimal-shortest paths of selected routes is a great choice to solve the problem and enables the validity of the results.