1.1 --- a/src/work/marci/preflow_demo_jacint.cc	Wed Feb 18 15:58:28 2004 +0000
     1.2 +++ b/src/work/marci/preflow_demo_jacint.cc	Wed Feb 18 17:27:13 2004 +0000
     1.3 @@ -27,7 +27,8 @@
     1.4    double pre_time=currTime();
     1.5    preflow_push_max_flow<ListGraph, int> max_flow_test(G, s, t, cap);
     1.6    max_flow_test.run();
     1.7 -  ListGraph::NodeMap<bool> cut=max_flow_test.mincut();
     1.8 +  ListGraph::NodeMap<bool> cut(G); 
     1.9 +  max_flow_test.mincut(cut);
    1.10    int cut_value=0;
    1.11    for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
    1.12      if (cut.get(G.tail(e)) && !cut.get(G.head(e))) cut_value+=cap.get(e);
    1.13 @@ -50,7 +51,8 @@
    1.14    double pre_time=currTime();
    1.15    preflow_push_hl<ListGraph, int> max_flow_test(G, s, t, cap);
    1.16    max_flow_test.run();
    1.17 -  ListGraph::NodeMap<bool> cut=max_flow_test.mincut();
    1.18 +  ListGraph::NodeMap<bool> cut(G);
    1.19 +  max_flow_test.mincut(cut);
    1.20    int cut_value=0;
    1.21    for(EachEdgeIt e=G.first<EachEdgeIt>(); e.valid(); ++e) {
    1.22      if (cut.get(G.tail(e)) && !cut.get(G.head(e))) cut_value+=cap.get(e);