Tech Used

C++

What is Dijkstra’s Algorithm?

Dijkstra’s algorithm is used to find the shortest path between any two nodes on in a graph. I was tasked with using this algorithm which had very minimal code resources online (other than the logic of how the algorithm works), and implementing it on the Hong Kong subway system.

If you would like to run the program:

1. Go to : https://replit.com/@MicahBuller/Dijkstra-in-Hong-Kong-Subway-System
2. Click “Run” in the top right corner.
3. When prompted for a station that you are currently at please reference the image below for the numbers you can choose from.
4. Enter a station you would like to go to by choosing from the available list.
5. The program will print out your shortest path.

Reference Photo