1.1 --- a/src/work/athos/min_cost_flow.cc Tue May 25 15:11:11 2004 +0000
1.2 +++ b/src/work/athos/min_cost_flow.cc Tue May 25 17:01:26 2004 +0000
1.3 @@ -41,6 +41,13 @@
1.4 Node v5=graph.addNode();
1.5 Node t=graph.addNode();
1.6
1.7 + ListGraph::NodeMap<int> supply_demand(graph);
1.8 +
1.9 + supply_demand.set(s, 2);
1.10 + supply_demand.set(v1, 3);
1.11 + supply_demand.set(v3, -1);
1.12 + supply_demand.set(t, -4);
1.13 +
1.14 Edge s_v1=graph.addEdge(s, v1);
1.15 Edge v1_v2=graph.addEdge(v1, v2);
1.16 Edge s_v3=graph.addEdge(s, v3);
1.17 @@ -81,7 +88,8 @@
1.18 MinCostFlow< ListGraph, ListGraph::EdgeMap<int>, ListGraph::NodeMap<int> >
1.19 min_cost_flow_test(graph, cost, supply_demand);
1.20
1.21 - int k=1;
1.22 + min_cost_flow_test.run();
1.23 + //int k=1;
1.24
1.25 /*
1.26 check( min_cost_flow_test.run(s,t,k) == 1 && min_cost_flow_test.totalLength() == 19,"One path, total cost should be 19");