[SciPy-User] Matrix-free version of connected_components
Tue Aug 7 02:23:22 CDT 2012
Ah hehe. I have had a hard time optimizing my graph neighbor extraction
code, so right now it is actually to slow to be of any use. I will try to
find a different approach and I dont want you spending any of your time
cleaning code, but thank you very much for the offer :)
On Tue, Aug 7, 2012 at 3:41 AM, Charles R Harris
> On Mon, Aug 6, 2012 at 3:33 AM, Per Nielsen <firstname.lastname@example.org> wrote:
>>> I'm not sure what your application is, but if you just need connected
>>> components and have an easy way to find neighbors, then unionfind will
>>> partition the set for you. Although the common version doesn't make it easy
>>> to extract them, I have an implementation that keeps the connected nodes in
>>> a circular list for just that application.
>> I would very like to have copy of your algorithm, it might be easier to
>> modify than the networkX code as Gael suggested.
> Well, it's in Cython ;) It is set up to use integer indices as node labels
> and all components are extracted as lists of integers. It's also pretty old
> and needs documentation, so I'll do that and clean it up a bit. I'll be on
> travel for the next few days, so unless matters are pressing, I won't get
> to it until the weekend.
> SciPy-User mailing list
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the SciPy-User