Finding the Shortest Path Using Dijkstra’s Algorithm

Authors

Orit D. Gruber, CUNY College of Staten IslandFollow
Deborah Sturm, CUNY College of Staten IslandFollow

Document Type

Activity or Lab

Publication Date

Summer 6-11-2024

Abstract

This lab experiment explores an algorithm which is used to find the shortest path between two or more locations. After completing the lab, you will be able to answer the following questions in the final lab report:

1. What is an Algorithm?
2. What is a Graph ?
3. What is the purpose and operation of Dijkstra’s Algorithm ?

Creative Commons License

This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 4.0 License.