diff options
| author | ysitu <ysitu@users.noreply.github.com> | 2014-08-17 03:41:20 -0400 |
|---|---|---|
| committer | ysitu <ysitu@users.noreply.github.com> | 2014-08-17 03:41:20 -0400 |
| commit | 0697c9f1b95bfe3175fcc3c00089b1770cda55e6 (patch) | |
| tree | 12fb412023b2f7b936aafbbd370d08f7b6f948cf | |
| parent | 332880d1924471a528519756432ece4c850393bb (diff) | |
| download | networkx-0697c9f1b95bfe3175fcc3c00089b1770cda55e6.tar.gz | |
Fix exception messages and docstring in capacity-scaling min-cost flowv1.9
| -rw-r--r-- | networkx/algorithms/flow/capacityscaling.py | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/networkx/algorithms/flow/capacityscaling.py b/networkx/algorithms/flow/capacityscaling.py index ca85293d..110575dd 100644 --- a/networkx/algorithms/flow/capacityscaling.py +++ b/networkx/algorithms/flow/capacityscaling.py @@ -40,7 +40,7 @@ def _detect_unboundedness(R): if nx.negative_edge_cycle(G): raise nx.NetworkXUnbounded( 'Negative cost cycle of infinite capacity found. ' - 'Min cost flow unbounded below.') + 'Min cost flow may be unbounded below.') @not_implemented_for('undirected') @@ -60,7 +60,7 @@ def _build_residual_network(G, demand, capacity, weight): if e.get(weight, 0) < 0 and e.get(capacity, inf) == inf: raise nx.NetworkXUnbounded( 'Negative cost cycle of infinite capacity found. ' - 'Min cost flow bounded below.') + 'Min cost flow may be unbounded below.') # Extract edges with positive capacities. Self loops excluded. if G.is_multigraph(): @@ -193,7 +193,7 @@ def capacity_scaling(G, demand='demand', capacity='capacity', weight='weight', ------ NetworkXError This exception is raised if the input graph is not directed, - not connected or is a multigraph. + not connected. NetworkXUnfeasible This exception is raised in the following situations: |