-
Notifications
You must be signed in to change notification settings - Fork 0
Implemented Djikstra's algorithm for finding the shortest path from one node to all others. A grey scale image is read in with one byte numbers representing "altitude" of that node in the graph and the difference in altitude between nodes representing the cost of moving between those nodes.
beem812/Shortest-Path-Implementation
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
Implemented Djikstra's algorithm for finding the shortest path from one node to all others. A grey scale image is read in with one byte numbers representing "altitude" of that node in the graph and the difference in altitude between nodes representing the cost of moving between those nodes.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published