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…