This program demonstrates Dijkstra's path-finding algorithm.
"Dijkstra’s algorithm is a popular algorithm for solving many single-source shortest path problems having non-negative edge weight in the graphs i.e., it is to find the shortest distance between two vertices on a graph. It was conceived by Dutch computer scientist Edsger W. Dijkstra in 1956." -GeeksForGeeks
In our application:
- Vertices are cities
- Edges are routes between cities
- Weights are the distances between cities
Click HERE to see a visualization of the algorithm
For instructions on building and running this program, read BUILD.md
Copyright 2023 - Mark P. Earl. All Rights Reserved.