Changeset 986:e997802b855c in lemon-0.x for src/work/jacint/preflow.cc

Timestamp:

11/13/04 13:53:28 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1376

Message:

Naming changes:

• head -> target
• tail -> source

File:

• src/work/jacint/preflow.cc (modified) (5 diffs)

src/work/jacint/preflow.cc

@@ -47 +47 @@
   for(G.first(e); G.valid(e); G.next(e)) {
     int c=cap[e];
-    if (mincut[G.tail(e)] && !mincut[G.head(e)]) min_min_cut_value+=c;
-    if (cut[G.tail(e)] && !cut[G.head(e)]) min_cut_value+=c; 
-    if (maxcut[G.tail(e)] && !maxcut[G.head(e)]) max_min_cut_value+=c;
+    if (mincut[G.source(e)] && !mincut[G.target(e)]) min_min_cut_value+=c;
+    if (cut[G.source(e)] && !cut[G.target(e)]) min_cut_value+=c; 
+    if (maxcut[G.source(e)] && !maxcut[G.target(e)]) max_min_cut_value+=c;
   }
 
@@ -87 +87 @@
   for(G.first(e); G.valid(e); G.next(e)) {
     int c=cap[e];
-    if (mincut2[G.tail(e)] && !mincut2[G.head(e)]) min_min_cut2_value+=c;
-    if (cut2[G.tail(e)] && !cut2[G.head(e)]) min_cut2_value+=c; 
-    if (maxcut2[G.tail(e)] && !maxcut2[G.head(e)]) max_min_cut2_value+=c;
+    if (mincut2[G.source(e)] && !mincut2[G.target(e)]) min_min_cut2_value+=c;
+    if (cut2[G.source(e)] && !cut2[G.target(e)]) min_cut2_value+=c; 
+    if (maxcut2[G.source(e)] && !maxcut2[G.target(e)]) max_min_cut2_value+=c;
   }
 
@@ -139 +139 @@
   for(G.first(e); G.valid(e); G.next(e)) {
     int c=cap[e];
-    if (mincut3[G.tail(e)] && !mincut3[G.head(e)]) min_min_cut3_value+=c;
-    if (cut3[G.tail(e)] && !cut3[G.head(e)]) min_cut3_value+=c; 
-    if (maxcut3[G.tail(e)] && !maxcut3[G.head(e)]) max_min_cut3_value+=c;
-    if (actcut3[G.tail(e)] && !actcut3[G.head(e)]) act_min_cut3_value+=c;
+    if (mincut3[G.source(e)] && !mincut3[G.target(e)]) min_min_cut3_value+=c;
+    if (cut3[G.source(e)] && !cut3[G.target(e)]) min_cut3_value+=c; 
+    if (maxcut3[G.source(e)] && !maxcut3[G.target(e)]) max_min_cut3_value+=c;
+    if (actcut3[G.source(e)] && !actcut3[G.target(e)]) act_min_cut3_value+=c;
   }
 
@@ -196 +196 @@
   for(G.first(e); G.valid(e); G.next(e)) {
     int c=cap[e];
-    if (mincut4[G.tail(e)] && !mincut4[G.head(e)]) min_min_cut4_value+=c;
-    if (cut4[G.tail(e)] && !cut4[G.head(e)]) min_cut4_value+=c; 
-    if (maxcut4[G.tail(e)] && !maxcut4[G.head(e)]) max_min_cut4_value+=c;
+    if (mincut4[G.source(e)] && !mincut4[G.target(e)]) min_min_cut4_value+=c;
+    if (cut4[G.source(e)] && !cut4[G.target(e)]) min_cut4_value+=c; 
+    if (maxcut4[G.source(e)] && !maxcut4[G.target(e)]) max_min_cut4_value+=c;
   }
 
@@ -239 +239 @@
   for(G.first(e); G.valid(e); G.next(e)) {
     int c=cap[e];
-    if (mincut5[G.tail(e)] && !mincut5[G.head(e)]) min_min_cut5_value+=c;
-    if (cut5[G.tail(e)] && !cut5[G.head(e)]) min_cut5_value+=c; 
-    if (maxcut5[G.tail(e)] && !maxcut5[G.head(e)]) max_min_cut5_value+=c;
+    if (mincut5[G.source(e)] && !mincut5[G.target(e)]) min_min_cut5_value+=c;
+    if (cut5[G.source(e)] && !cut5[G.target(e)]) min_cut5_value+=c; 
+    if (maxcut5[G.source(e)] && !maxcut5[G.target(e)]) max_min_cut5_value+=c;
   }