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

Remove subgraph attributes tests, now they are in a separate file.

2015-05-10T15:09:03+00:00

Modernize biconnected tests, and remove subgraph attributes tests.

2015-05-10T15:07:38+00:00

Move subgraph attribute copies tests to a separate file.

2015-05-10T15:06:20+00:00

Add tests for subgraphs without copy for [bi]components.

2015-05-07T03:27:02+00:00

This brings coverage to 100% in all modules of the components package.

Update attracting_components docs and improve tests.

2015-05-07T01:46:13+00:00

Make strongly CC return a generator of sets, and improve docs and tests.

2015-05-07T01:17:37+00:00

Following #1501 work, now strongly_connected_components and friends
yield sets of nodes. Added examples to the documentation for getting a
sorted list of components, and also the largest. Improved tests and
raised coverage to 100%.

Fixed a docstring example for `simple_cycles` that was relaying on
the output order of SCC.

Refactor and improve documentation for weakly connected components.

2015-05-07T00:05:53+00:00

weakly_connected_components returns now a generator of sets. Also
refactored the BFS computation which was using a single source
shortest path algorithm, as in connected_components.

Add node attribute with the list of original nodes in the SCC.

2014-05-10T12:06:31+00:00

Also improved the code for condensation by avoiding unnecessary for loops.

Add mapping dict as graph attribute in condensation.

2014-05-05T16:05:26+00:00

Updated documentation and added a test.

Add recognition algorithm for semiconnected graphs

2014-04-25T19:00:21+00:00