Hi Alex, Sounds good. I'm too implemented routing over OSM data using boost::graph and gigabase as a storage. While standard graph algorithms work well for small graphs, for larger ones some extra steps can be useful. I wonder if you know/interested in implemented HH approach - http:// algo2.iti.uka.de/schultes/hwy/ which would allow for efficient route planning over OSM data (will be very large one day!)
Regards Artem On 8 Nov 2007, at 15:58, Alex Wilson wrote: > I've also been implementing routing over OSM data - using the Boost > graph library (BGL). I have a GUI written in PyQT4 interfacing with > a routing backend written in C++, using Boost python to create the > interface between the two languages. > It's a nice solution because there are a large number of algorithms > in the BGL and they've all been very thoroughly tested. > > I was also considering using the boost spirit parser to allow users > to specify edge costs using expressions - so if, for instance, you > were a law-breaking cyclist, you could specify that you were happy > too cycle down one-way streets the wrong way if ever it would save > you significant time over a legal route ;-) > > I'm very happy to contribute any code I have or to pitch in if > anyone needs any help (I have a lot of experience with graph > algorithms). > > Alex Wilson > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/routing _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/routing
