summaryrefslogtreecommitdiff
path: root/networkx/algorithms/components
Commit message (Expand)AuthorAgeFilesLines
...
* Make strongly_connected_components linear time O(m+n) (#2994)Dan Schult2018-06-022-2/+32
* Pep8 fixesJarrod Millman2018-01-207-48/+65
* Update copyrightJarrod Millman2018-01-206-6/+6
* Deprecate component_subgraphs functions (#2819)Dan Schult2018-01-0911-279/+111
* Expand documentation regarding strong connectivity (#2732)gfyoung2017-11-032-1/+8
* Correct when we raise NetworkXNotImplemented (#2731)gfyoung2017-11-021-3/+3
* Removed unused imports (#2653)James Lamb2017-10-011-1/+1
* Simplify base classes. (#2604)Dan Schult2017-08-122-15/+15
* [ENH] Added functions for k-edge-connected components/subgraphs (#2554)Jon Crall2017-08-081-0/+7
* Some changes to reduce the really long parts of tests (#2561)Dan Schult2017-08-021-1/+2
* Refactor set_node_attributes() and set_edge_attributes() (#2553)Michael E. Rose2017-07-261-1/+1
* Update copyrightJarrod Millman2017-07-256-6/+6
* minor corrections to doc comments (#2453)Jamie Cox2017-05-151-3/+3
* update documentation for articulation_pointsleotrs2016-12-151-5/+5
* make the right function callleotrs2016-12-141-1/+1
* change articulation_points so that it only returns every vertex once - solves...leotrs2016-12-142-1/+10
* Minor correction in documentationAllen Downey2016-07-061-1/+1
* Correct see also linksMichael-E-Rose2016-04-206-44/+44
* Apply PEP8 in codeMichael-E-Rose2016-04-162-15/+18
* Format/Correct/Extend docstrings and update top of modulesMichael-E-Rose2016-04-166-98/+196
* UnboundLocalError if called with an empty graphAli Baharev2016-03-281-0/+1
* Change all X.add_path yp nx.add_path(X,Dan Schult2016-02-024-17/+17
* Update copyrightsMridul Seth2016-01-013-3/+3
* topolgical_sort, lexicographical_topological_sortNeil2015-08-311-2/+2
* Merge master into iter_refactorDan Schult2015-08-071-1/+2
* Remove edges_iter, G.edges() now returns an iterator instead of listMridul Seth2015-06-171-1/+1
* Makes Graph.nodes() return iterator instead of listJeffrey Finkelstein2015-06-112-2/+2
* Remove subgraph attributes tests, now they are in a separate file.Jordi Torrents2015-05-104-123/+39
* Modernize biconnected tests, and remove subgraph attributes tests.Jordi Torrents2015-05-101-153/+111
* Move subgraph attribute copies tests to a separate file.Jordi Torrents2015-05-101-0/+84
* Add tests for subgraphs without copy for [bi]components.Jordi Torrents2015-05-072-43/+78
* Update attracting_components docs and improve tests.Jordi Torrents2015-05-072-28/+46
* Make strongly CC return a generator of sets, and improve docs and tests.Jordi Torrents2015-05-073-112/+213
* Refactor and improve documentation for weakly connected components.Jordi Torrents2015-05-072-99/+179
* Refactor and improve the documentation for connected_components.Jordi Torrents2015-05-072-55/+148
* fix pep8SanketDG2015-05-071-46/+50
* fix docstringSanketDG2015-05-071-1/+0
* Fix copyrightsJGab2015-04-214-4/+4
* Fix docstring for strongly_connected_componentsJuan Nunez-Iglesias2015-03-121-3/+3
* Fix kosaraju_strongly_connected_components documentationysitu2014-07-151-2/+1
* corrected docstringdrevicko2014-07-011-3/+3
* Cleanup code a bit more.chebee7i2014-05-131-2/+2
* Use nx.utils.reversed in kosaraju scc.chebee7i2014-05-121-9/+9
* Merge pull request #1141 from jtorrents/condensation-mappingysitu2014-05-112-10/+28
|\
| * Add node attribute with the list of original nodes in the SCC.Jordi Torrents2014-05-102-13/+19
| * Add mapping dict as graph attribute in condensation.Jordi Torrents2014-05-052-1/+13
* | DOC: definition of weak connectivity in is_weakly_connected docstringalex2014-05-081-1/+6
|/
* Add recognition algorithm for semiconnected graphsysitu2014-04-253-0/+118
* Merge pull request #1019 from hagberg/doc-fixesAric Hagberg2013-11-241-1/+1
|\
| * Doc formatting fixesAric Hagberg2013-11-241-1/+1
View Lorry Controller Status