Home
last modified time | relevance | path

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 Dtest_weighted.py549 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 Dtest_exceptions.py38 with pytest.raises(nx.NetworkXUnbounded):
39 raise nx.NetworkXUnbounded
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/tests/
H A Dtest_mincost.py39 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 Dtest_networksimplex.py322 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 Dtest_maxflow.py313 pytest.raises(nx.NetworkXUnbounded, flow_func, G, "s", "t")
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/shortest_paths/
H A Dweighted.py1207 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 Dexception.py77 class NetworkXUnbounded(NetworkXAlgorithmError): class
/dports/math/py-networkx/networkx-2.6.3/doc/reference/
H A Dexceptions.rst26 .. autoclass:: networkx.NetworkXUnbounded
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/
H A Dcapacityscaling.py35 raise nx.NetworkXUnbounded(
56 raise nx.NetworkXUnbounded(
H A Ddinitz_alg.py207 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
H A Dedmondskarp.py30 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
H A Dutils.py165 raise nx.NetworkXUnbounded(
H A Dshortestaugmentingpath.py79 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
H A Dboykovkolmogorov.py359 raise nx.NetworkXUnbounded("Infinite capacity path, flow unbounded above.")
H A Dnetworksimplex.py612 raise nx.NetworkXUnbounded("negative cycle with infinite capacity found")