Just in case someone is interested, here’s a graph which shows dot’s memory consumption on a random graph with no options as the number of nodes and edges increases, indipendently (click on the image for full view).
Only half of the graph is meaningful, the one on the side on the viewer (this is because I used dove tailing in exploring the node/edge space, and after that half dot run off with a >1Gb-memory-footprint run which OOM-killed it and prevented me to run anymore).
As you can see, the incidence of edges on the memory consumption is exponential, whereas the nodes’ effect is irrelevant. Since I want to graph something with about 50000 nodes and 70000 edges (splinder blog network), I wonder how I will be able to.
