MountainPaths is a Python algorithms project that finds a path of least resistance from west to east across a topographical map.
Built as a final project for an Algorithms course, this project applies pathfinding ideas to topographical data in order to compare and compute efficient routes through mountain terrain.
- analyze topological map data
- evaluate routes across changing elevation
- find efficient west-to-east paths
- compare algorithmic approaches to path selection
- Greedy Algorithm
- Dijkstra's Algorithm
- Python
This project connects algorithm theory with a visual, data-driven problem and highlights how implementation choices affect path quality and efficiency.