Tristram Gräbener schreef: >>> They use something very different for routing. >>> >> Then what is their algorithm? >> > There a good chances that they use an approach similar to that one : > > Precomputation: > - Find 100 × 100 points in europe (that means a point every 30km) > - Compute the distance between all those points and store it > >
Every 30km? Choose a popular location close to it .. You know what a transition matrix is?? Product of transition matrix?? The Nth product will give you all paths of lenth N ;-) (close subject: markov chains) In modern times 100.000 destinations isn't that much ;-) 100.000 x 100.000 matrix. I made fractals that were about 23500x23500 pixels and I didn't find a print shop where they could print decently ;-) only 2gb r...@home This black white image can be seen as a trans matrix with 23500 locations. (allocated must have been 32 bits for 1 pixel black or white) Marc -- What's on Shortwave guide: choose an hour, go! http://whatsonshortwave.tk 700+ Radio Stations on SW http://swstations.tk 300+ languages on SW http://radiolanguages.tk _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
