Skip to content

Finding the shortest path in a grey-scale elevation map. Converts all pixels in the image to Nodes with elevation data gathered from analysis of the unsigned char value at any given pixel. Then utilizes Dijkstra's algorithm for a greedy search with a priority queue, organized with a node comparison binary functor, to first find the shortest path…

Notifications You must be signed in to change notification settings

alistenberger/Shortest_Path_Elevation_Map

Repository files navigation

image files need to be opened in photoshop (or whatever you have that can view .raw files)

Finding the shortest path in a grey-scale elevation map.

Converts all pixels in the image to Nodes with elevation data gathered from analysis of the unsigned char value at any given pixel.

Then utilizes Dijkstra's algorithm for a breadth-first, greedy search, and a priority queue, organized with a node comparison binary functor, to first find the shortest path to all nodes from Node (0,0).

Finally utilizes a singly linked-list to trace the shortest path from the end back to the start.

About

Finding the shortest path in a grey-scale elevation map. Converts all pixels in the image to Nodes with elevation data gathered from analysis of the unsigned char value at any given pixel. Then utilizes Dijkstra's algorithm for a greedy search with a priority queue, organized with a node comparison binary functor, to first find the shortest path…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published