This program reads a set of topographic data and uses several methods (Greedy Walks, Floyd Warshall's Algorithm, and Dijkstra's Algorithm) to compute several paths through the mountains that minimize change in elevation. The program then uses Allegro to illustrate the topographic data and paths for the user to visualize.
-
Notifications
You must be signed in to change notification settings - Fork 1
This program reads a set of topographic data and uses several methods (Greedy Walks, Floyd Warshall's Algorithm, and Dijkstra's Algorithm) to compute paths through the mountains that minimize change in elevation.
Keaton11/Nifty-Mountains
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
This program reads a set of topographic data and uses several methods (Greedy Walks, Floyd Warshall's Algorithm, and Dijkstra's Algorithm) to compute paths through the mountains that minimize change in elevation.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published