Hello, On Thu, Jul 31, 2008 at 11:39, Freek <[EMAIL PROTECTED]> wrote: > On Wednesday 30 July 2008, Vojtech Brtnik wrote: >> generating of traffic problem,... representing/saving huge graphs in >> memory/HDD... > > If you want to go in the direction of I/O-efficient algorithms, this might be > a good first pointer: > http://www.springer.com/computer/foundations/book/978-3-540-00883-5 > It is available online if you have access to Springer. See for example > chapter 4: "Elementary Graph Algorithms in External Memory".
You might also want to look at Z-curves, UB-trees and the like : http://en.wikipedia.org/wiki/Z-order_(curve) They are quite useful to build efficient data structures adaptated to routing. Sincerely yours, david _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/cgi-bin/mailman/listinfo/routing
