Nifty-Mountains-Project - Eric Karpovits

The objective of the project was to find the best cumulative elevation change given a topographic data set of a mountain.

Description: This program reads in a set of topographic mountain elevation data into a 2D array. Then calculates the best lowest-elevation-change path from West-to-East using various algorithms. The program also draws the actual mountain given the data into a 2D map using monochrome or interpolated colours and visualizes various paths through the mountains. This program will also return various total elevation changes given different “best” paths across the mountain and provide path results, a meaningful analysis, and insightful statistics, such as efficiency metrics.

The algorithms used include the greedy algorithm, 2 improved greedy algorithm, and the Floyd–Warshall Shortest Path algorithm algorithm which finds the best possible path.

This project is based on and solves the Standford Mountain Climb Project http://nifty.stanford.edu/2016/franke-mountain-paths/

Enjoy :smile: