diff -r d306e777117e -r 0155001b6f65 src/work/athos/min_cost_flow.cc
--- a/src/work/athos/min_cost_flow.cc	Tue May 25 15:11:11 2004 +0000
+++ b/src/work/athos/min_cost_flow.cc	Tue May 25 17:01:26 2004 +0000
@@ -41,6 +41,13 @@
   Node v5=graph.addNode();
   Node t=graph.addNode();
 
+  ListGraph::NodeMap<int> supply_demand(graph);
+
+  supply_demand.set(s, 2);
+  supply_demand.set(v1, 3);
+  supply_demand.set(v3, -1);
+  supply_demand.set(t, -4);
+
   Edge s_v1=graph.addEdge(s, v1);
   Edge v1_v2=graph.addEdge(v1, v2);
   Edge s_v3=graph.addEdge(s, v3);
@@ -81,7 +88,8 @@
   MinCostFlow< ListGraph, ListGraph::EdgeMap<int>, ListGraph::NodeMap<int> >
     min_cost_flow_test(graph, cost, supply_demand);
 
-  int k=1;
+  min_cost_flow_test.run();
+  //int k=1;
 
   /*
   check(  min_cost_flow_test.run(s,t,k) == 1 && min_cost_flow_test.totalLength() == 19,"One path, total cost should be 19");