[SciPy-User] Matrix-free version of connected_components

[Per Nielsen]

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 :)

Per

On Tue, Aug 7, 2012 at 3:41 AM, Charles R Harris
<charlesr.harris at gmail.com>wrote:

>
>
> On Mon, Aug 6, 2012 at 3:33 AM, Per Nielsen <evilper at gmail.com> 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.
>
> Chuck
>
> _______________________________________________
> SciPy-User mailing list
> SciPy-User at scipy.org
> http://mail.scipy.org/mailman/listinfo/scipy-user
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.scipy.org/pipermail/scipy-user/attachments/20120807/cf63b83e/attachment.html>