[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Rewiring connected graph and/or checking connectedness loca
Re: [igraph] Rewiring connected graph and/or checking connectedness locally
Wed, 11 May 2011 15:10:10 -0400
Well, yes. On a second thought, if you check for connectedness anyway,
not to mention betweenness, after each deletion and addition, then
igraph is good enough. The connectedness check has the same time
complexity as edge addition/deletion, and betweenness is much worse.
I would suggest that you try profiling your code to see what takes long.
On Wed, May 11, 2011 at 3:06 PM, Tamás Nepusz <address@hidden> wrote:
>> I didn't know that igraph wasn't ideal for dynamical graphs. I used it
>> mainly cause I didn't had time to create my own library.
> I just want to add that if your graph has only a couple of nodes as you
> mentioned (~20-50 vertices), then you're probably OK with igraph.
> igraph-help mailing list
Gabor Csardi <address@hidden> MTA KFKI RMKI