How would you adapt QuickGraph for billion nodes etc.

Topics: algorithm
Sep 14, 2008 at 5:12 AM
The idea is you store the entire graph in a DB and load a "View" into QG. When you hit a node that has some edges left in the DB you go get them while possibly discarding a few nodes from memory. Any ideas on how to do it?    
Sep 14, 2008 at 8:58 AM
Look for "I/O Efficient data structure" in the litterature.
Sep 15, 2008 at 2:28 PM
Forgive me, I am new here.  Exactly what literature are you referring to?  The User Manual wiki?  Can you recommend the best book to buy in regards to getting my mind around this concept or any sample code where quick graph is used to solve every day problems.  For example determining electrical load between devices?

Sep 15, 2008 at 3:25 PM
Justin, this is a different topic. Please start a new thread.

By litterate, I mean academic article (and there is a lot of research on this topic). Most of the tools in this area are in C++ (look for STXXL).

Use your favorite search engine.
Sep 24, 2008 at 5:57 PM
Any decent implementations that I can buy, beg or borrow? Most of the work I found are theoritical.
Sep 25, 2008 at 5:30 AM
Not that i'm aware of in the .net space.