[SciPy-User] Graph connect components and sparse matrices
Thu Nov 19 10:21:56 CST 2009
Nathan Bell wrote:
> On Thu, Nov 19, 2009 at 6:51 AM, Robert Cimrman <firstname.lastname@example.org> wrote:
>> It's now in ticket #1057.
> Hi Robert,
> Sorry for getting on this thread so late, I've been extremely busy lately.
> I think we should definitely include more graph algorithms in
> scipy.sparse. The cost of extracting the same info via eigenvectors
> is high and the results are less trustworthy.
> We've implemented several such algorithms (like connected_components
> ) in PyAMG. Since the code is organized in similar fashion to
> scipy.sparse it would make sense to transfer some or all of the
> functionality in pyamg.graph into scipy.sparse.graph or some such
> namespace. I'd also like to add some reordering methods like RCM and
> nested bisection.
>  http://code.google.com/p/pyamg/source/browse/trunk/pyamg/graph.py#271
I have implemented RCM into sfepy too... Fortunately, I already had a C
functions lying around, so I did not waste too much time on that. It would be
perfect to have all this in scipy instead!
More information about the SciPy-User