Hello ! I worked an other routing application. It's still extreamly modest, and I made it mostly to have something to hack arround during my PhD (about mutlitmodal and multiobjective routing).
Therefore it's quite bad at routing (only shortest path, not fastest) and will probably stay as it. I made an interface based on marble, that looks nice, but doesn't has any specific interest neither. I finaly made my own data parser (I thought first using the one from pgRouting) that exports in a sqlite base. Maybe this could interest some people. The parsing is quite fast (5 minutes for France) but drops tons of usefull information for a good routing. So it's nice if you just want a simple topology (we could imagine for a student project for example). The route calculation is based on Boost::Graph dijkstra. Through France is about a second calculation. The code is under GPL3 at http://github.com/Tristramg/mumoro and few screenshots at http://wiki.github.com/Tristramg/mumoro/home Have a nice day! _______________________________________________ Routing mailing list Routing@openstreetmap.org http://lists.openstreetmap.org/listinfo/routing
