> I reat a paper on it. Quite interesting. > Basically precomputing lots of routes > with a lot of simplifying.
I'd suggest to read it again if you mean the Contraction Hierachies paper. The method is based on node contraction. That means it is inserting so-called shortcuts into the graph. Nodes are deleted from the graph and new edges are inserted that shortcut the deleted node. Routes are computed only to verify if a shortcut is necessary. No precomputed paths are stored. -Dennis _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
