[SciPy-User] Matrix-free version of connected_components
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 <
> 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
> > employ similar methods for finding the connected components. Thus I
> > need the full sparse matrix (or graph which I think is similar in
> > 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.
> SciPy-User mailing list
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the SciPy-User