Searched refs:NetworkXUnbounded (Results 1 – 15 of 15) sorted by relevance
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/shortest_paths/tests/ |
H A D | test_weighted.py | 549 nx.NetworkXUnbounded, nx.single_source_bellman_ford_path, G, i 554 pytest.raises(nx.NetworkXUnbounded, nx.single_source_bellman_ford, G, i) 558 pytest.raises(nx.NetworkXUnbounded, nx.goldberg_radzik, G, i) 563 nx.NetworkXUnbounded, nx.single_source_bellman_ford_path, G, i 572 pytest.raises(nx.NetworkXUnbounded, nx.goldberg_radzik, G, i) 576 nx.NetworkXUnbounded, nx.single_source_bellman_ford_path_length, G, 1 578 pytest.raises(nx.NetworkXUnbounded, nx.single_source_bellman_ford, G, 1) 580 nx.NetworkXUnbounded, nx.bellman_ford_predecessor_and_distance, G, 1 582 pytest.raises(nx.NetworkXUnbounded, nx.goldberg_radzik, G, 1) 853 pytest.raises(nx.NetworkXUnbounded, nx.johnson, G) [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/tests/ |
H A D | test_exceptions.py | 38 with pytest.raises(nx.NetworkXUnbounded): 39 raise nx.NetworkXUnbounded
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/tests/ |
H A D | test_mincost.py | 39 pytest.raises(nx.NetworkXUnbounded, nx.capacity_scaling, G) 349 pytest.raises(nx.NetworkXUnbounded, nx.network_simplex, G) 350 pytest.raises(nx.NetworkXUnbounded, nx.capacity_scaling, G) 384 pytest.raises(nx.NetworkXUnbounded, nx.network_simplex, G) 385 pytest.raises(nx.NetworkXUnbounded, nx.capacity_scaling, G) 397 pytest.raises(nx.NetworkXUnbounded, nx.network_simplex, G) 398 pytest.raises(nx.NetworkXUnbounded, nx.capacity_scaling, G)
|
H A D | test_networksimplex.py | 322 pytest.raises(nx.NetworkXUnbounded, nx.network_simplex, G) 340 pytest.raises(nx.NetworkXUnbounded, nx.network_simplex, G) 350 pytest.raises(nx.NetworkXUnbounded, nx.network_simplex, G)
|
H A D | test_maxflow.py | 313 pytest.raises(nx.NetworkXUnbounded, flow_func, G, "s", "t")
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/shortest_paths/ |
H A D | weighted.py | 1207 raise nx.NetworkXUnbounded("Negative cost cycle detected.") 1323 raise nx.NetworkXUnbounded("Negative cost cycle detected.") 1338 raise nx.NetworkXUnbounded("Negative cost cycle detected.") 1813 raise nx.NetworkXUnbounded("Negative cost cycle detected.") 1880 raise nx.NetworkXUnbounded("Negative cost cycle detected.") 1971 except nx.NetworkXUnbounded:
|
/dports/math/py-networkx/networkx-2.6.3/networkx/ |
H A D | exception.py | 77 class NetworkXUnbounded(NetworkXAlgorithmError): class
|
/dports/math/py-networkx/networkx-2.6.3/doc/reference/ |
H A D | exceptions.rst | 26 .. autoclass:: networkx.NetworkXUnbounded
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/ |
H A D | capacityscaling.py | 35 raise nx.NetworkXUnbounded( 56 raise nx.NetworkXUnbounded(
|
H A D | dinitz_alg.py | 207 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
|
H A D | edmondskarp.py | 30 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
|
H A D | utils.py | 165 raise nx.NetworkXUnbounded(
|
H A D | shortestaugmentingpath.py | 79 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
|
H A D | boykovkolmogorov.py | 359 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
|
H A D | networksimplex.py | 612 raise nx.NetworkXUnbounded("negative cycle with infinite capacity found")
|