[graph-tool] Memory requirement estimate for a large graph
nicolinidisi at gmail.com
Mon Jul 6 13:00:18 CEST 2020
How is it possible to get an estimate for the memory requirement of a graph
I know that graph-tool is built upon C++ and Boost, and the adjacency list
is stored via a hash-map.
Apart from the cost of storing the values of vertices indices and edges
indices as `unsigned long`, what is the memory overhead of the structures
used in storing the graph?
For example, for a network of 1M vertices and 100M links without
attributes, how much real memory should I plan to use, excluding
Sorry if the question is repeated, but I could not find it in the previous
mailing list posts.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the graph-tool