summaryrefslogtreecommitdiff
path: root/networkx/algorithms/connectivity/connectivity.py
Commit message (Expand)AuthorAgeFilesLines
* Lint using Ruff (#6371)danieleades2023-02-191-6/+6
* Fix doc inconsistencies related to cutoff in connectivity.py and disjoint_pat...Paula Pérez Bianchi2022-10-271-15/+9
* Use isort with pre-commit to enforce import guidelines (#5659)Mridul Seth2022-06-021-6/+8
* Format python in docstrings (#4168)Jarrod Millman2020-08-191-6/+4
* Format w/ blackJarrod Millman2020-07-101-2/+6
* Update string formatJarrod Millman2020-01-011-44/+42
* Upgrade to Py36 syntaxJarrod Millman2020-01-011-1/+1
* Convert %-format to fstringJarrod Millman2020-01-011-4/+4
* Improve test coverageJarrod Millman2019-12-311-1/+1
* Remove superfluous encoding informationJarrod Millman2019-11-111-1/+0
* Remove boiler plate from top of modulesJarrod Millman2019-11-111-2/+0
* Remove future imports needed by Py2Jarrod Millman2019-09-181-1/+0
* Fix several DeprecationWarning: invalid escape sequence (#3284)Mickaël Schoentgen2019-01-081-1/+1
* Added function for finding a k-edge-augmentation (#2572)Jon Crall2017-10-021-2/+18
* Update docsJarrod Millman2017-08-181-7/+9
* [ENH] Added functions for k-edge-connected components/subgraphs (#2554)Jon Crall2017-08-081-0/+2
* rename parameters to conform with the docstring and similar functions (#2463)Dosenpfand2017-05-301-2/+2
* Add Boykov Kolmogorov algorithm for maximum flow problems.Jordi Torrents2016-05-061-0/+5
* Add Dinitz algorithm to connectivity tests.Jordi Torrents2016-04-241-1/+7
* Update networkx/generators/directed.py and connectivity/node_connectivity.pyMridul Seth2015-06-291-5/+2
* Remove degree_iter(),now degree() returns an integer for single node and iter...Mridul Seth2015-06-271-3/+4
* Merge pull request #1589 from MridulS/succprediterDan Schult2015-06-171-2/+2
|\
| * Remove successors_iter() and predecessors_iter(). G.successors() and G.predec...Mridul Seth2015-06-121-2/+2
* | Merge pull request #1588 from MridulS/neigbhorsiterDan Schult2015-06-171-2/+2
|\ \
| * | Remove neighbors_iter, G.neighbors() now returns an iterator instead of listMridul Seth2015-06-121-2/+2
| |/
* | Merge remote-tracking branch 'upstream/iter_refactor' into iter_refactorMridul Seth2015-06-171-1/+1
|\ \
| * | Makes Graph.nodes() return iterator instead of listJeffrey Finkelstein2015-06-111-1/+1
| |/
* | Minor docstring fixes.chebee7i2015-06-151-58/+60
|/
* Fix all_pairs_node_connectivity results dict. Fixes #1406.Jordi Torrents2015-03-151-2/+5
* Adapt connectivity package to the removal of flow_funcs from namespace.Jordi Torrents2014-05-221-13/+21
* Use dict for returning all pairs node connectivity.Jordi Torrents2014-05-151-29/+22
* Revert "Remove all_pairs_node_connectivity_matrix function."Jordi Torrents2014-05-151-1/+73
* Clean up docstrings.Jordi Torrents2014-05-141-10/+10
* Added checks for only source or only target specified.Jordi Torrents2014-05-121-0/+6
* Remove local connectivity/cut functions from the base namespace.Jordi Torrents2014-05-031-19/+37
* Improve cutoff handling: node connectivity is bounded by minimum degree.Jordi Torrents2014-05-031-3/+4
* Remove all_pairs_node_connectivity_matrix function.Jordi Torrents2014-05-031-73/+1
* Added examples reusing data structures and improved docstrings.Jordi Torrents2014-05-031-71/+95
* Improve auxiliary digraphs for connectivity functions.Jordi Torrents2014-05-021-30/+31
* Refactor connectivity package.Jordi Torrents2014-04-291-248/+407
* Fix obsolete uses of maximum flow interface in connectivity.Jordi Torrents2014-04-241-2/+2
* Remove @require decoratorAric Hagberg2013-11-091-2/+0
* Whitespace cleanupAric Hagberg2013-07-281-107/+101
* Move dominating set code to separate packageAric Hagberg2013-07-281-34/+1
* Tests for node connectivityAric Hagberg2013-07-281-10/+20
* Add new module for flow based connectivity and cut algorithmsJordi Torrents2012-07-211-0/+607