1.1 --- a/src/work/jacint/preflow_excess_test.cc	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/work/jacint/preflow_excess_test.cc	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -52,14 +52,14 @@
     1.4    int min_min_cut_value=0;
     1.5    EdgeIt e;
     1.6    for(G.first(e); G.valid(e); G.next(e)) {
     1.7 -    if (mincut[G.tail(e)] && !mincut[G.head(e)]) min_min_cut_value+=cap[e];
     1.8 +    if (mincut[G.source(e)] && !mincut[G.target(e)]) min_min_cut_value+=cap[e];
     1.9    }
    1.10  
    1.11    Graph::NodeMap<bool> cut(G);
    1.12    max_flow_test.minCut(cut); 
    1.13    int min_cut_value=0;
    1.14    for(G.first(e); G.valid(e); G.next(e)) {
    1.15 -    if (cut[G.tail(e)] && !cut[G.head(e)]) 
    1.16 +    if (cut[G.source(e)] && !cut[G.target(e)]) 
    1.17        min_cut_value+=cap[e];
    1.18    }
    1.19  
    1.20 @@ -67,7 +67,7 @@
    1.21    max_flow_test.maxMinCut(maxcut); 
    1.22    int max_min_cut_value=0;
    1.23    for(G.first(e); G.valid(e); G.next(e)) {
    1.24 -    if (maxcut[G.tail(e)] && !maxcut[G.head(e)]) 
    1.25 +    if (maxcut[G.source(e)] && !maxcut[G.target(e)]) 
    1.26        max_min_cut_value+=cap[e];
    1.27        }
    1.28  
    1.29 @@ -99,14 +99,14 @@
    1.30    max_flow_test2.minMinCut(mincut2); 
    1.31    int min_min_cut_value2=0;
    1.32      for(G.first(e); G.valid(e); G.next(e)) {
    1.33 -    if (mincut2[G.tail(e)] && !mincut2[G.head(e)]) min_min_cut_value2+=cap[e];
    1.34 +    if (mincut2[G.source(e)] && !mincut2[G.target(e)]) min_min_cut_value2+=cap[e];
    1.35    }
    1.36  
    1.37    Graph::NodeMap<bool> cut2(G);
    1.38    max_flow_test2.minCut(cut2); 
    1.39    int min_cut_value2=0;
    1.40    for(G.first(e); G.valid(e); G.next(e)) {
    1.41 -    if (cut2[G.tail(e)] && !cut2[G.head(e)]) 
    1.42 +    if (cut2[G.source(e)] && !cut2[G.target(e)]) 
    1.43        min_cut_value2+=cap[e];
    1.44    }
    1.45  
    1.46 @@ -114,7 +114,7 @@
    1.47    max_flow_test2.maxMinCut(maxcut2); 
    1.48    int max_min_cut_value2=0;
    1.49    for(G.first(e); G.valid(e); G.next(e)) {
    1.50 -    if (maxcut2[G.tail(e)] && !maxcut2[G.head(e)]) 
    1.51 +    if (maxcut2[G.source(e)] && !maxcut2[G.target(e)]) 
    1.52        max_min_cut_value2+=cap[e];
    1.53        }
    1.54    
    1.55 @@ -144,14 +144,14 @@
    1.56    max_flow_test3.minMinCut(mincut3); 
    1.57    int min_min_cut_value3=0;
    1.58    for(G.first(e); G.valid(e); G.next(e)) {
    1.59 -    if (mincut3[G.tail(e)] && !mincut3[G.head(e)]) min_min_cut_value3+=cap[e];
    1.60 +    if (mincut3[G.source(e)] && !mincut3[G.target(e)]) min_min_cut_value3+=cap[e];
    1.61    }
    1.62  
    1.63    Graph::NodeMap<bool> cut3(G);
    1.64    max_flow_test3.minCut(cut3); 
    1.65    int min_cut_value3=0;
    1.66    for(G.first(e); G.valid(e); G.next(e)) {
    1.67 -    if (cut3[G.tail(e)] && !cut3[G.head(e)]) 
    1.68 +    if (cut3[G.source(e)] && !cut3[G.target(e)]) 
    1.69        min_cut_value3+=cap[e];
    1.70    }
    1.71  
    1.72 @@ -159,7 +159,7 @@
    1.73    max_flow_test3.maxMinCut(maxcut3); 
    1.74    int max_min_cut_value3=0;
    1.75    for(G.first(e); G.valid(e); G.next(e)) {
    1.76 -    if (maxcut3[G.tail(e)] && !maxcut3[G.head(e)]) 
    1.77 +    if (maxcut3[G.source(e)] && !maxcut3[G.target(e)]) 
    1.78        max_min_cut_value3+=cap[e];
    1.79        }
    1.80