Hi everyone, Please share with me the following information:
Which data structure you used to model a graph (i.e adjacency list or adjacency matrix data structure)? How big is your graph in term of number of routing nodes and routing links or number of vertices and edges? Can you load the whole graph into memory when you calculate a route? How long does it take to calculate a 35km shortest route through NewYork city? Do you use any special technic to speed up A* algorithm? (like using sorted open list,...) Thank for sharing your idea in advance. Regards, -- View this message in context: http://www.nabble.com/How-big-is-your-graph--How-long-to-find-30km-route-in-your-graph--tp19985191p19985191.html Sent from the OpenStreetMap - Routing mailing list archive at Nabble.com. _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
