Re: [igraph] alternate diameter paths

[Gabor Csardi]

Hmmm, that works fine with me, at least for a random graph with the 
same number of vertices and edges. 

> g <- erdos.renyi.game(5162, 13468, type="gnm")
> for (i in V(g)) { print(i) ; tmp <- get.all.shortest.paths(g, i, V(g)) }

It takes about 10 minutes on my laptop and never uses more 
memory than 50Mb. Obviously, you cannot store the results of each run,
you need to search for the paths that are as long as the diameter,
and keep only those. Otherwise you'll run out of memory, that's true.

PS. could you please join the list or post from the address you're signed
up with? Thanks.

G.

On Fri, May 16, 2008 at 10:51:22AM -0400, Alisa Coffin wrote:
> 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).
> 
> Alisa.
> 
> 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)
> 
>     --
>     Tamas
> 
> 
> 
>         > 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
>     address@hidden
>     http://lists.nongnu.org/mailman/listinfo/igraph-help
> 
> 
> 
> 
> 
> --
> Alisa Coffin, PhD. Candidate
> Department of Geography
> University of Florida
> Gainesville, FL 32611

> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help


-- 
Csardi Gabor <address@hidden>    UNIL DGM