Posted by aron novak on June 10, 2006 at 3:08pm
I would like to thank to Trey (www.hup.hu) to give me one of the biggest Hungarian Drupal-based site's sql dump. I could test to create a graph from such a huge data (the whole sql dump is about 180 Mb) . I used serialize to store the graph. The graph has ~70 000 edges (weighted and directed) but the memory footprint (and the serialized file) is just ~770 Kb. As far as I know a gdbm-type file isn't very comfortable to store adjacentcy list while the Dijkstra algorithm has such type of input. The sna module is likely to use serialize to store the graph.