delta/python-packages/networkx.git/networkx/algorithms/components/biconnected.py, branch docdraft github.com: networkx/networkx.git Refactor and improve the documentation for connected_components. 2015-05-06T23:05:16+00:00 Jordi Torrents jordi.t21@gmail.com 2015-05-03T15:13:27+00:00 d72b854ef6ad39cd346498752da19cfeff41192f 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. 
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.
Whitespace and formatting cleanup 2013-11-12T14:35:03+00:00 Aric Hagberg aric.hagberg@gmail.com 2013-11-12T14:35:03+00:00 caf1d6dc23557becc8e7349099d868b9b00a8377 






change the other code in networkx/algorithms/components to return generators of components instead of lists of components, Add option to copy (or not) component subgraph data.
2013-11-12T12:04:13+00:00

francis.chan
f1ancis621@gmail.com

2013-11-12T12:04:13+00:00

9005bd2977d864f74c179601f6f3c4f913612c47












Be explicit about attr_dict in edge_subgraph and more tests
2011-10-09T02:04:36+00:00

Dan Schult
dschult@colgate.edu

2011-10-09T02:04:36+00:00

b65cbacda486fae2ac90a6167d727b44b16395c9

Addresses #588





Addresses #588







Fix typo in edge_subgraph
2011-10-08T22:01:12+00:00

Dan Schult
dschult@colgate.edu

2011-10-08T22:01:12+00:00

dc5d89c702f650b7a6c079864a811695ff0c2068

and add attribute tests to component routines that return subgraphs

Addresses #588





and add attribute tests to component routines that return subgraphs

Addresses #588







Apply patch for copying subgraph data. Addresses #588.
2011-10-04T00:56:49+00:00

Aric Hagberg
aric.hagberg@gmail.com

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

ae5f3e6df0d36aafe62201dfd8cbc0548d837c15

This could still use review.





This could still use review.







Add patch to switch back to simpler _dfs algorithm.
2011-08-06T00:18:23+00:00

Aric Hagberg
aric.hagberg@gmail.com

2011-08-06T00:18:23+00:00

4b0750bf45ff6a0690eb173af9e3d07bc7eac151

Closes #609





Closes #609







Function for articulation points and biconnected components.
2011-08-05T14:41:38+00:00

Aric Hagberg
aric.hagberg@gmail.com

2011-08-05T14:41:38+00:00

1c47cc2d431958191af1caa6fde60b36cd724f42

Addresses #609





Addresses #609







Add biconnected articulation points and biconnected components functions.  Addresses #609
2011-08-01T20:22:01+00:00

Aric Hagberg
aric.hagberg@gmail.com

2011-08-01T20:22:01+00:00

1f05ac89b1b257fec67dd68ea2a92967ab1fbe69