summaryrefslogtreecommitdiff
path: root/networkx/algorithms/flow
Commit message (Expand)AuthorAgeFilesLines
...
* Pep8 fixesJarrod Millman2018-01-208-210/+212
* Update copyrightJarrod Millman2018-01-203-3/+3
* change variable names to avoid kwargs clobber (#2824)Dan Schult2018-01-101-24/+28
* Dictionary comprehensions from #1700 merged conflicts (#2768)Dan Schult2017-11-253-5/+5
* Update docsJarrod Millman2017-08-185-25/+17
* Simplify base classes. (#2604)Dan Schult2017-08-127-67/+67
* Some changes to reduce the really long parts of tests (#2561)Dan Schult2017-08-021-4/+12
* remove print statement from test (#2569)Mridul Seth2017-07-311-1/+0
* Refactor set_node_attributes() and set_edge_attributes() (#2553)Michael E. Rose2017-07-265-10/+10
* Update copyrightJarrod Millman2017-07-252-2/+2
* Add Gomory-Hu tree representation of undirected graphs. (#2425)Jordi Torrents2017-06-283-0/+292
* Move data structure to private names and replace with readonly structures (#2...Dan Schult2017-06-266-1/+2
* Refactor Dinitz' algorithm implementation.Jordi Torrents2016-07-232-37/+46
* Merge pull request #2122 from jtorrents/boykov-kolmogorovJordi Torrents2016-07-235-3/+397
|\
| * Add search trees to a graph attribute and improve documentation.Jordi Torrents2016-05-111-2/+28
| * Do not use lambda for the key argument for sorting.Jordi Torrents2016-05-111-4/+7
| * Implement marking heuristic for Boykov-Kolmogorov algorithm.Jordi Torrents2016-05-091-31/+74
| * Add Boykov Kolmogorov algorithm for maximum flow problems.Jordi Torrents2016-05-065-3/+325
* | Merge remote-tracking branch 'refs/remotes/networkx/master'thegreathippo2016-05-017-10/+296
|\ \ | |/
| * Merge pull request #1978 from jtorrents/dinitzDan Schult2016-04-265-8/+261
| |\
| | * Speed up the implementation.Jordi Torrents2016-04-241-13/+17
| | * Add Dinitz algorithm to connectivity tests.Jordi Torrents2016-04-241-1/+1
| | * Perform BFS and DFS on the residual, not the input graph.Jordi Torrents2016-04-241-2/+2
| | * Add Dinitz' algorithm for maximum flow problems.Jordi Torrents2016-02-045-8/+257
| * | Improve Notes section on simplex and friends docs.Jordi Torrents2016-04-242-2/+35
* | | Remove attr_dict from DiGraph add_node, add_edgethegreathippo2016-05-011-7/+14
|/ /
* | Change all X.add_path yp nx.add_path(X,Dan Schult2016-02-021-7/+7
|/
* DOC: Updating docstring to mention issues about demands.Jamie Morton2015-12-091-3/+3
* Two more doc formating changes.Dan Schult2015-10-041-14/+0
* Fix some sphinx formatting errorsDan Schult2015-10-043-28/+30
* Add flow functions from utils to __all__Dan Schult2015-10-031-0/+1
* Make sure __all__ variables loaded in flow __init__.pyDan Schult2015-09-141-9/+12
* Solve merge conflictsMridul Seth2015-08-132-6/+14
|\
| * Merge master into iter_refactorDan Schult2015-08-072-6/+14
* | Update single_source_shortest_path_length and all_pairs_shortest_path_length ...Mridul Seth2015-08-131-1/+1
|/
* Remove edges_iter, G.edges() now returns an iterator instead of listMridul Seth2015-06-174-9/+9
* Added spaces after commas.boothby2015-05-221-3/+3
* add test case for #1542Tom Boothby2015-05-221-0/+8
* resolves issue #1542Tom Boothby2015-05-221-1/+1
* Avoid unnecessary subtree tracing in network simplex methodysitu2014-11-041-3/+4
* Merge branch 'ns' of https://github.com/ysitu/networkx into ysitu-nschebee7i2014-11-033-375/+513
|\
| * Fix typo in network_simplex docstringysitu2014-11-021-1/+1
| * Reimplement the network simplex method for min-cost flowsysitu2014-11-023-375/+513
* | Correct infeasibility detection in capacity scaling min-cost flowysitu2014-11-032-19/+46
|/
* Merge 1.9.1 changes into masterysitu2014-09-251-3/+3
|\
| * Fix exception messages and docstring in capacity-scaling min-cost flowv1.9ysitu2014-08-171-3/+3
* | Remove legacy ford_fulkerson maximum flow functionysitu2014-08-059-336/+25
|/
* Add test for MultiGraph input.Jordi Torrents2014-05-231-0/+7
* Cosmetic changes in maximum flow tests on 'large' graphs.Jordi Torrents2014-05-231-22/+11
* Simplify __init__.py for the flow package.Jordi Torrents2014-05-231-12/+10