Hi I need a fast algorithm and input data to it to calculate for user what cities and villages are on the track from one city to another. I realized that this is not simple especialy if speed of the calculation is crucial. I was thinking about fetching OSM data for one country and transform it to the graph with nodes and edges. Let's name this graph IG - Input Graph. Now I would like to proces this IG to OG (output graph) that contains only cities/villages nodes and edges that are calculated based on IG roads. In simple words I need a graph that let me calculate in fast way the answer to question: If I start from city nr 3 and want to drive to city nr 7 what city/village will I be passing? The answers are:
The city / village nodes are retrieved from OSM file. The Output Graph edges should have weight calculated based on the Input Graph edges. The measure of the weight is in general distance in meters from one node to the next. My question is. Does somebody was working on something like this. I don't want to duplicate somebodys work. Ofcourse everybody are welcome to help me do it in right way. asked 01 Apr '12, 10:35 Kapuch |
My advice: contact the developers of the many Openstreetmap routing services. ( http://wiki.openstreetmap.org/wiki/Routing ) Within their software developments they definitely will have dealt with the kind of graph decisions that you are thinkng about here. H. answered 01 Apr '12, 16:56 Herve5 ... or leave a message to the Routing mailinglist that can be found here:
(01 Apr '12, 18:57)
stephan75
Thank You for advice. I just post them an email.
(01 Apr '12, 19:54)
Kapuch
|