
From:  Claudio Martella 
Subject:  Re: [igraph] generating large graphs 
Date:  Sat, 27 Jul 2013 16:33:20 +0200 
The memory you need for a graph is (2*n + 4*m) * 8 bytes, where 'n' is the number of vertices and 'm' is the number of edges. So if the density of the graph is not too large, this should be possible. Can you send some code that reproduces this?GaborOn Sat, Jul 27, 2013 at 8:37 AM, Claudio Martella <address@hidden> wrote:
_______________________________________________Hello guys,I've been trying to build a graph with over 32M vertices using Barabasi() via the python wrapper. The machine I'm currently using has around 160G of main memory but the process is being OOMkilled by the kernel. I was able to generate a 16M vertices graph with a usage of around 50% of memory. Do you guys have some suggestions about how i can generate such large graphs (potentially in a distributed fasion), as I'm actually aiming also at larger ones?Thanks,Claudio
Claudio Martella
address@hidden
igraphhelp mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraphhelp
_______________________________________________
igraphhelp mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraphhelp
[Prev in Thread]  Current Thread  [Next in Thread] 