[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] igraph (R) get.all.shortest.paths memory issue

From: Pascal Jürgens
Subject: Re: [igraph] igraph (R) get.all.shortest.paths memory issue
Date: Wed, 4 Aug 2010 22:41:03 +0200

Oh, also, if I recall correctly, even 64bit binaries of R have a limit on 
maximum matrix sizes - this might explain why you get an OOM even though swap 
may still be available. If I'm actually right on this, you might want to 
consider using the python igraph interface instead of the R one.

On Aug 4, 2010, at 10:12 PM, Dazhi Jiao wrote:

> Hi,
> I am a new user of igraph. I am currently use it for a relative large 
> directed network (~7.5K vertices, ~20K edges). 
> I need to calculate the shortest paths bewteen the vertices, and I found that 
> it throws an error:
> Error in get.all.shortest.paths(g, i, to = j, mode = "out") : 
>   At vector.pmt:972 : canot copy vector, Out of memory
> Is there any way to work around this? The computer I am running this on has 
> 8G memory. 
> Thanks!
> Dazhi

reply via email to

[Prev in Thread] Current Thread [Next in Thread]