It’s been a while since I’ve started using your open source routing engine: I found it really helpful and easy to understand, so first of all I want to thank you for your great work! Keep it going
Currently I am facing an issue: given an OSM map and a bounding box, I must be able to get all the possible paths, regardless of the road direction and the profile. Every path has to be taken at its longest (since subpaths are not allowed) and only once.
Therefore, I need a full coverage of both the nodes and the edges, belonging to the bbox, of an undirectional graph built upon the OSM map. So far I’ve tried many workarounds to achieve that, but currently I am completely stuck.
Could you please help me sort this out?
Any help would be appreciated, thanks beforehand