rtparnow / eurlirian-path Goto Github PK

RunCityStreets v0.2 (Alpha)

Motivation + Aims:
This project was started with a desire to run the length of my entire local area. I soon learned that
route planning could get pretty complicated - especially if you want to avoid re-running streets.

This project aims to find the most efficient running routes to achieve the above goal. 

Current State of the Project:
Provided with a shapefile of a given road network, the program converts this to a graph. From this graph,
the Eulerian path is calculated, if this is not possible you can calculate the semi-eulirian path.

In its current state, the best route will only be created for a fraction of the users.

Graph creation logic:
The current graph creation code removes nodes (street corners) that have either 0 streets connected to them,
or an odd number of streets connected to them. This is in an effort to ensure at least a semi-eulirian path
is possible. This logic may be flawed and I invite improvements.

Next steps:
- calculate the next best path is eulirian or semi-eulirian paths are not possible.
- output calculated path to a gpx file
- automate path calculation so that it finds the eulirian, then semi-eulirian then hamiltonian - in that order.
- GUI
- produce a shapefile automatically from an area selected on an open streetmap


Please don't distribute or try and make money using my code without my permission etc.