[SciPy-User] Graph connect components and sparse matrices
Thu Nov 19 05:51:34 CST 2009
Robert Cimrman wrote:
> Gael Varoquaux wrote:
>> On Wed, Nov 18, 2009 at 03:03:43PM +0100, Robert Cimrman wrote:
>>> Hi Gael,
>>> Gael Varoquaux wrote:
>>>> Hi there,
>>>> I would like to list the connect components of a graph (or a sparse
>>>> matrix, same thing). I know of course of the bread-first traversal, as
>>>> implemented eg in networkX, to find the connect components. However, I
>>>> have a feeling that sparse linear algebra must be performing such
>>>> searches, to decompose sparse matrices in blocks. I'd love to piggy back
>>>> on such implementations, rather than code and maintain a C or cython
>>>> version of breadth-first graph traversal.
>>> I have a function in C (as a part of sfepy), that does that. But as it
>>> might be useful for more people, what about putting it scipy
>> I think it would be very useful. I would actually include it in the
>> scipy.sparse namespace too.
> OK, I will give it a shot (soon), unless someone jumps in with a better solution.
It's now in ticket #1057.
More information about the SciPy-User