[Top][All Lists]

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

Re: [igraph] alternate diameter paths

From: Alisa Coffin
Subject: Re: [igraph] alternate diameter paths
Date: Fri, 16 May 2008 10:51:22 -0400

Hi Tamas,

The graph below has 5162 nodes and 13468 edges. It's a directed graph, but symmetric, so, theoretically I could reduced it to 6734 edges. However, I don't want to simplify it because I have multiple edges in some cases that I don't want to lose (I made some earlier posts about this, and decided it was easier to keep it as a directed graph in the end).


On Fri, May 16, 2008 at 5:08 AM, Tamas Nepusz <address@hidden> wrote:
Dear Alisa,

How large is your graph? (# of nodes and edges)


> get.all.shortest.paths(g1975, 2028, 4334, mode = c("all"))
Error in get.all.shortest.paths(g1975, 2028, 4334, mode = c("all")) :
 At vector_ptr.c:169 : vector ptr reserve failed, Out of memory

igraph-help mailing list

Alisa Coffin, PhD. Candidate
Department of Geography
University of Florida
Gainesville, FL 32611
reply via email to

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