diff options
| author | Paula Pérez Bianchi <44149844+paulitapb@users.noreply.github.com> | 2022-10-20 22:26:04 -0300 |
|---|---|---|
| committer | Jarrod Millman <jarrod.millman@gmail.com> | 2022-11-01 10:27:55 -0700 |
| commit | 7fad255f1a5b272f336039ca1567cb66f9c521a4 (patch) | |
| tree | 4f47dc7bf8f11959337c57a19c1f0d924e956aec | |
| parent | afcfbf5534f354afcff8e82b5990223c01a4a126 (diff) | |
| download | networkx-7fad255f1a5b272f336039ca1567cb66f9c521a4.tar.gz | |
Tested boykov_kolmogorov and dinitz with cutoff (#6104)
| -rw-r--r-- | networkx/algorithms/flow/tests/test_maxflow.py | 11 |
1 files changed, 10 insertions, 1 deletions
diff --git a/networkx/algorithms/flow/tests/test_maxflow.py b/networkx/algorithms/flow/tests/test_maxflow.py index 36bc5ec7..b8e985c3 100644 --- a/networkx/algorithms/flow/tests/test_maxflow.py +++ b/networkx/algorithms/flow/tests/test_maxflow.py @@ -539,11 +539,20 @@ class TestCutoff: assert k <= R.graph["flow_value"] <= (2 * k) R = edmonds_karp(G, "s", "t", cutoff=k) assert k <= R.graph["flow_value"] <= (2 * k) + R = dinitz(G, "s", "t", cutoff=k) + assert k <= R.graph["flow_value"] <= (2 * k) + R = boykov_kolmogorov(G, "s", "t", cutoff=k) + assert k <= R.graph["flow_value"] <= (2 * k) def test_complete_graph_cutoff(self): G = nx.complete_graph(5) nx.set_edge_attributes(G, {(u, v): 1 for u, v in G.edges()}, "capacity") - for flow_func in [shortest_augmenting_path, edmonds_karp]: + for flow_func in [ + shortest_augmenting_path, + edmonds_karp, + dinitz, + boykov_kolmogorov, + ]: for cutoff in [3, 2, 1]: result = nx.maximum_flow_value( G, 0, 4, flow_func=flow_func, cutoff=cutoff |