SIMULATION DIJKSTRA’S ALGROTHM FIND SHORTES PATH BETWEEN NODES
Abstract
This project focuses on the design and development of a computer-based simulation system that demonstrates the operation of Dijkstra’s Algorithm, a fundamental algorithm used for finding the shortest path between nodes in a weighted graph. The objective of this work is to provide a practical, visual, and interactive platform that helps students, researchers, and professionals understand how the algorithm proesses nodes, updates distances, and determines the most efficient routes within a network.The system allows users to create and manipulate graphs by adding nodes and assigning edge weights. Through the graphical interface, users can specify a starting node and observe how Dijkstra’s Algorithm iteratively explores the graph to compute the shortest paths. The simulation also provides step-by-step visualization of the algorithm’s logic, including distance updates, node selection, and final path construction.Overall, the simulation system enhances conceptual understanding, bridges the gap between theoretical and practical learning, and ves rce in computer science, operations research, and network optimization studies.
Full-Text Access Notice
In accordance with the NERD Policy on promoting peer-reviewed publication, public access to the full text of a project, thesis or dissertation is restricted for three years, allowing the author and supervisors sufficient time to pursue peer-reviewed publication.
During this period, researchers with legitimate academic or research purposes may request authorisation directly from the author to enable NERD to release the indexed full texts of the work using the form below.