Application of shortest path problem in the university campus using Dijkstra’s algorithm

The university campus site is usually widespread, and the location of one office or facility is relatively far from each other. Therefore, determining the shortest path from one point to another is crucial as it can save time and other valuable resources, especially for university students. This study is designed to analyse the network model of the university campus layout and establish the shortest path between a starting point and a destination in the university campus network by using Dijkstra's algorithm. This study examines the algorithm to find the shortest path from an origin at a student residential site to the destination point at the main library on the IIUM Kuantan campus. The experimental result by using Dijkstra's algorithm gives the shortest path that the students can travel from their residence at Mahallah Fatimah az-Zahra to the Dar al-Hikmah Library across the Kulliyyah of Allied Health Sciences.