Changeset 986:e997802b855c in lemon-0.x for src/work/jacint/preflow_res.h

Timestamp:

11/13/04 13:53:28 (20 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_res.h (modified) (8 diffs)

src/work/jacint/preflow_res.h

@@ -103 +103 @@
         for(res_graph.first(e,v); res_graph.valid(e); 
             res_graph.next(e)) {
-          Node w=res_graph.tail(e);
+          Node w=res_graph.source(e);
           if ( level[w] == n && w != s ) {
             bfs_queue.push(w);
@@ -146 +146 @@
       for(res_graph.first(e,s); res_graph.valid(e); 
           res_graph.next(e)) {
-          Node w=res_graph.head(e);
+          Node w=res_graph.target(e);
           if ( level[w] < n ) {   
             if ( excess[w] == 0 && w!=t ) {
@@ -191 +191 @@
               for(res_graph.first(e,v); 
                   res_graph.valid(e); res_graph.next(e)) {
-                Node u=res_graph.tail(e);
+                Node u=res_graph.source(e);
                 if ( level[u] >= n ) { 
                   bfs_queue.push(u);
@@ -222 +222 @@
           for(res_graph.first(e,w); res_graph.valid(e); res_graph.next(e)) {
             
-            Node v=res_graph.head(e);            
+            Node v=res_graph.target(e);            
             if( lev > level[v] ) {      
               /*Push is allowed now*/
@@ -401 +401 @@
         OutEdgeIt e;
         for(G.first(e,w) ; G.valid(e); G.next(e)) {
-          Node v=G.head(e);
+          Node v=G.target(e);
           if (!M[v] && flow[e] < capacity[e] ) {
             queue.push(v);
@@ -410 +410 @@
         InEdgeIt f;
         for(G.first(f,w) ; G.valid(f); G.next(f)) {
-          Node v=G.tail(f);
+          Node v=G.source(f);
           if (!M[v] && flow[f] > 0 ) {
             queue.push(v);
@@ -441 +441 @@
         InEdgeIt e;
         for(G.first(e,w) ; G.valid(e); G.next(e)) {
-          Node v=G.tail(e);
+          Node v=G.source(e);
           if (!M[v] && flow[e] < capacity[e] ) {
             queue.push(v);
@@ -450 +450 @@
         OutEdgeIt f;
         for(G.first(f,w) ; G.valid(f); G.next(f)) {
-          Node v=G.head(f);
+          Node v=G.target(f);
           if (!M[v] && flow[f] > 0 ) {
             queue.push(v);