A* algorithm

[AlexeyVolosnikov]

Do you have A* algorithm for routing (using data which is got from osmtoroadgraph)?

[AndGem]

Hi Alexey,

thanks for creating an issue. There is currently no routing algorithm implemented in this repository. However, a simple Dijkstra algorithm should be fairly easy to implement, and I was thinking of adding for an example.

Do you have a specific use-case in mind?

[AlexeyVolosnikov]

It is good to make A* algorithm for routing using data from osmtoroadgraph. Knowing start and goal node it will make shortest itinenary. I know 2 main routing algorithms. I got a question with good answer here about dijkstra algorithm so you could add function from AJNeufelds answer (because it is faster a little rather than my) or dijkstra function my question :). By the way I have A* algorithm with heristic, as far as I tested it it is working fine, but I am a newer and my code as far as I am presume is 'dirty' and not so readable. I can send it to you to read if you want.

And I do not think dijkstra algorithm is a good solution for routing problem if we use OSM data, because there is thousands and thousands of nodes (if we take one city) and it will calculate route an enourmous amount of time. Thats is only the city, what about region? That isnt good

[AndGem]

Hi @AlexeyVolosnikov

sorry for the long silence. I'm working in the background on a bigger change to the project which should make using routing algorithms quite simple.

Currently, I'm working on this PR #70
This allows to save the output of the program to a file format that can be read by networkx. There are some integrated routing algorithms, but it should also be easy to play around with your own. I'll add an example on how to do that. I'll update once this is done.