A one-off project to find good hiking paths through a terrain, given how much vertical changes should be avoided. The technique involves treating a raster image as if it were a graph, weighting the edges appropriately, and running Dijkstra's shortest path algorithm on it.