summaryrefslogtreecommitdiff
path: root/networkx/algorithms/flow/utils.py
Commit message (Collapse)AuthorAgeFilesLines
* Use isort with pre-commit to enforce import guidelines (#5659)Mridul Seth2022-06-021-0/+1
| | | | | * Add isort to pre-commit * Run isort on all python files (except __init__.py ones)
* Format w/ black==20.8b1Jarrod Millman2020-10-061-6/+3
|
* Format w/ blackJarrod Millman2020-07-101-19/+38
|
* Upgrade to Py36 syntaxJarrod Millman2020-01-011-4/+4
| | | | find networkx -name \*.py -exec pyupgrade --py36-plus {} \;
* Remove superfluous encoding informationJarrod Millman2019-11-111-1/+0
|
* Remove boiler plate from top of modulesJarrod Millman2019-11-111-5/+0
| | | | | | | | | The copyright and author stuff is not necessary, out-of-date, and inconsistent. It takes up visual space and is a pain to police everyone doing the same thing on the top of the module. Git handles authorship in a comprehensive and authoritative way. The LICENSE.txt file applies to all project code.
* Dictionary comprehensions from #1700 merged conflicts (#2768)Dan Schult2017-11-251-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | * use dict comprehensions in kcomponents.py * use dict comprehensions in test_kcomponents * use dict comprehensions in test_kcutsets * use dict comprehensions in test_maxflow * use dict comprehensions in test_maxflow_large_graph * use dict comprehensions in flow/utils.py * use dict comprehensions in weighted.py * use dict comprehensions in graphml.py * use dict comprehensions in nx_pylab.py * use dict comprehensions in relabel.py * use dict comprehensions in assortavity/mixing.py * conform to pep8 guidelines in mixing.py * Minor tweaks to kcomponents to update to v2.0
* Remove edges_iter, G.edges() now returns an iterator instead of listMridul Seth2015-06-171-1/+1
|
* Add docstrings to build_residual_network and add it to sphinix docs.Jordi Torrents2014-05-221-0/+22
|
* Do not require source and sink to build a residual network.Jordi Torrents2014-04-261-8/+1
| | | | | | | Since the residual network is the same for every pair of nodes, delegate sanity checks on source and sink to algorithm implementations. This makes build_residual_network easier to use in the connectivity package, and in general.
* Add option to reuse residual networks in maxflow algorithmsysitu2014-04-261-19/+26
|
* Add capacity scaling minimum cost flow algorithmysitu2014-04-161-11/+14
|
* Move auxiliary stuff used by maxflow algorithms to separate fileysitu2014-04-081-0/+145