Date of Award

Spring 2021

Document Type

Thesis

Degree Name

Bachelor of Science (BS)

Department

Computing Sciences

College

College of Science

First Advisor

Paul Cerkez

Abstract/Description

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.

Download

Share

COinS