In this program, I wrote a program in C++ that uses Djikstra's algorithm to find the shortest path between two nodes in a graph. For more information on Djikstra's algorithm, see Wikipedia's article.
This code compiles with G++.
-
Notifications
You must be signed in to change notification settings - Fork 2
dtnewman/djikstra_shortest_path
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A C++ implementation of Djikstra's algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published