[SciPy-User] Matrix-free version of connected_components

Per Nielsen evilper@gmail....
Mon Aug 6 04:32:01 CDT 2012

You are completely right and the networkX code seems simple enough so that
I can actually manage it. Now I just need to optimize my graph/matrix
function as it calculates the entire graph/matrix MUCH faster than going
all the rows/columns individually.


On Thu, Aug 2, 2012 at 2:36 PM, Gael Varoquaux <
gael.varoquaux@normalesup.org> wrote:

> On Thu, Aug 02, 2012 at 02:15:07PM +0200, Per Nielsen wrote:
> >    I have looked into the functions provided by the networkX package,
> >    however, as far as I have been able to understand both networkX and
> scipy
> >    employ similar methods for finding the connected components. Thus I
> still
> >    need the full sparse matrix (or graph which I think is similar in
> memory
> >    usage) in memory, which I would like to avoid.
> But you can easily recode them to replace the indexing by a function call
> that would return the list of neighbors for a given node. That way you
> don't have to store the graph, you can generate it on the fly.
> G
> _______________________________________________
> SciPy-User mailing list
> SciPy-User@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/20120806/61f5b75f/attachment.html 

More information about the SciPy-User mailing list