delta/python-packages/networkx.git/networkx/algorithms/flow/tests, branch docdraft github.com: networkx/networkx.git Added spaces after commas. 2015-05-23T03:56:29+00:00 boothby tomas.boothby@gmail.com 2015-05-23T03:56:29+00:00 b474710ab83c0dc1f1d3cc1ae88d37f40066b6c9 






add test case for #1542
2015-05-22T18:54:41+00:00

Tom Boothby
tomas.boothby@gmail.com

2015-05-22T18:54:41+00:00

516879fd582c5542adedc7055c28e86c82a4ba2a












Merge branch 'ns' of https://github.com/ysitu/networkx into ysitu-ns
2014-11-04T02:13:30+00:00

chebee7i
chebee7i@gmail.com

2014-11-04T02:13:30+00:00

62bbde08e206c22599bc70bc2b579a5cf175ef74

Conflicts:
	networkx/algorithms/flow/tests/test_mincost.py





Conflicts:
	networkx/algorithms/flow/tests/test_mincost.py







Correct infeasibility detection in capacity scaling min-cost flow
2014-11-03T23:24:40+00:00

ysitu
ysitu@users.noreply.github.com

2014-11-03T23:24:40+00:00

6042951a078af410371ef52793edfa71c68c9038












Reimplement the network simplex method for min-cost flows
2014-11-02T14:35:37+00:00

ysitu
ysitu@users.noreply.github.com

2014-11-02T14:35:37+00:00

e7265994449f9887157641277d4fe7611519a127












Remove legacy ford_fulkerson maximum flow function
2014-08-05T22:45:06+00:00

ysitu
ysitu@users.noreply.github.com

2014-08-05T22:45:06+00:00

66d67489f221b7142165a55f474fdb4a46e4ce7a












Add test for MultiGraph input.
2014-05-23T13:28:06+00:00

Jordi Torrents
jordi.t21@gmail.com

2014-05-23T13:28:06+00:00

969a5385cce8f1db52eb3101c6001f1edb7df883












Cosmetic changes in maximum flow tests on 'large' graphs.
2014-05-23T10:52:46+00:00

Jordi Torrents
jordi.t21@gmail.com

2014-05-23T10:52:46+00:00

f9c3ed2f26029a249f88ff73fe9a90b40439a39d












Do not use ford_fulkerson in max flow tests for large graphs.
2014-05-22T16:26:36+00:00

Jordi Torrents
jordi.t21@gmail.com

2014-05-22T16:26:36+00:00

7ab5664d9f308fcf429bbe6f952884e8f82dc4f6

The goal is to speed up a bit the maximum flow tests for large graphs.
The regular tests for maximum flow algorithms are enough for making sure
that ford_fulkerson is correct. Also reused residual network when possible.





The goal is to speed up a bit the maximum flow tests for large graphs.
The regular tests for maximum flow algorithms are enough for making sure
that ford_fulkerson is correct. Also reused residual network when possible.







Remove flow functions from the base NetworkX namespace.
2014-05-22T11:08:51+00:00

Jordi Torrents
jordi.t21@gmail.com

2014-05-22T11:08:51+00:00

3474a15d2ac957ca36a7b20e7f14ca6dd6827b39

Also renamed files in the flow package so modules and functions have
different names; we obey the informal module-name-must-be-unique rule.
Updated tests and docstrings. The later needs a bit more work to clearly
explain that flow functions have to be explicitly imported from the
flow package.





Also renamed files in the flow package so modules and functions have
different names; we obey the informal module-name-must-be-unique rule.
Updated tests and docstrings. The later needs a bit more work to clearly
explain that flow functions have to be explicitly imported from the
flow package.