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

[Gábor Csárdi]

Hi Dahzi,

this is a bit strange, to be honest. Theoretically you can have a lot
of shortest paths in a (relatively) dense graph, and
get.all.shortest.paths has to keep track of all shortest paths to all
vertices (at least until it finds all paths that are shorter than the
one to j), so it might really need a lot of memory.

But still, I think 8Gb memory should work for a graph like yours.
Could you please send me your graph in private, so that I can
investigate this issue better?

Btw. which operating system are you using?

Thanks,
Gabor

On Wed, Aug 4, 2010 at 10:12 PM, Dazhi Jiao <address@hidden> 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
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM