Date of Award
Bachelor of Science (BS)
College of Science
Dijkstra’s algorithm has been widely studied and applied since it was first published in 1959. This research shows that Dijkstra’s algorithm can be used to find the shortest path between two stations on the Washington D.C. Metro. After exploring different types of research and applying Dijkstra’s algorithm, it was found that the algorithm will always yield the shortest path, even if visually a shorter path was initially expected.
Malamut, Taylor F., "Dijkstra’s Pathfinder" (2021). Honors Theses. 423.