[Top][All Lists]

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

Re: [igraph] help with cohesion.blocks (again...)

From: uxzmdlj02
Subject: Re: [igraph] help with cohesion.blocks (again...)
Date: Sat, 2 Feb 2008 16:15:40 -0600

I'm all in favor, it seems like it's a universal improvement in speed and reliability. I might try to rework it just a little bit so that it keeps track of which S and T it's already searched. The algorithm is designed to find cutsets between individual s and t vertices and does so by incrementally expanding subgraphs around each one. So the current implementation will very frequently re-searches the exact same subset of nodes. I say either way release it, but if I have time it will just add another speed increase. (I'm surprised I didn't find this algorithm the first time around!).

On Feb 2, 2008, at 3:35 PM, Gabor Csardi csardi-at-rmki.kfki.hu | igraph-help| wrote:

Peter, ok, i've removed the old implementation and included the new,
that seems to work well. (I've reimplemented the new algorithm, and
compared the results on several graphs, and also checked your code.)
This will be in igraph 0.5, if you don't have anything against it.


On Sat, Feb 02, 2008 at 03:28:16PM +0100, Gabor Csardi wrote:
Peter, thanks, i'll read over the paper(s) and see what to do.


Csardi Gabor <address@hidden>    UNIL DGM

igraph-help mailing list

reply via email to

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