delta/python-packages/networkx.git/networkx/algorithms/components/connected.py, branch docdraft

Refactor and improve the documentation for connected_components.

2015-05-06T23:05:16+00:00

Make connected_components a generator of sets of nodes, it was a generator
of list of nodes. See #1501 for discussion.

Use a plain BFS to compute them instead of using the single source
shortest path function. The latter also does a BFS but keeps track of the
distances. This is only slightly faster for small graphs (arround 5% in my
tests), but for larger graphs the speed up is more relevant (around 1.8x
faster). Also I think it's conceptually better. As @ysitu said, we have a
tendency to abuse shortest paths functions for reachability.

Also improved biconnected components examples, docstrings, and code.

Fix copyrights

2015-04-21T16:51:07+00:00

corrected docstring

2014-07-01T09:18:44+00:00

The docstring of connected_component_subgraphs() had one parameter (copy=True) listed as a Return.

Documentation for components change to generator.

2013-11-24T22:10:59+00:00

Addresses #964

Add example for sorting components by size

2013-10-24T13:14:42+00:00

Connected component subgraphs copy

2013-10-07T20:25:25+00:00

Add option to copy (or not) subgraph data.
Rework connected components algorithms as generators.

Apply patch for copying subgraph data. Addresses #588.

2011-10-04T00:56:49+00:00

This could still use review.

Even more imports cleanup and exceptions fixed.

2011-02-11T02:55:34+00:00

Remove component class code until we settle on design and location.

2010-11-11T15:31:42+00:00

Addresses #457

Adding class for incrementally tracking connected components.

2010-11-04T22:06:32+00:00