[Top][All Lists]

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

Re: [igraph] alternate diameter paths

From: Tamas Nepusz
Subject: Re: [igraph] alternate diameter paths
Date: Fri, 16 May 2008 17:04:16 +0200

The graph below has 5162 nodes and 13468 edges.
Hmmm... graphs of this size should not be a problem for igraph. I think there's something weird going on. I just successfully calculated all shortest paths from a single vertex on a graph much larger than this in a couple of seconds. Is it possible to send me your graph (see my email address above) so I can try to figure out what's going on?


reply via email to

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