Changeset 986:e997802b855c in lemon-0.x for src/work/deba/list_graph.h

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/deba/list_graph.h (modified) (6 diffs)

src/work/deba/list_graph.h

@@ -44 +44 @@
     struct EdgeT 
     {
-      int head, tail;
+      int target, source;
       int prev_in, prev_out;
       int next_in, next_out;
@@ -105 +105 @@
     int maxEdgeId() const { return edges.size(); }  //FIXME: What is this?
 
-    Node tail(Edge e) const { return edges[e.n].tail; }
-    Node head(Edge e) const { return edges[e.n].head; }
-
-    Node aNode(OutEdgeIt e) const { return edges[e.n].tail; }
-    Node aNode(InEdgeIt e) const { return edges[e.n].head; }
-
-    Node bNode(OutEdgeIt e) const { return edges[e.n].head; }
-    Node bNode(InEdgeIt e) const { return edges[e.n].tail; }
+    Node source(Edge e) const { return edges[e.n].source; }
+    Node target(Edge e) const { return edges[e.n].target; }
+
+    Node aNode(OutEdgeIt e) const { return edges[e.n].source; }
+    Node aNode(InEdgeIt e) const { return edges[e.n].target; }
+
+    Node bNode(OutEdgeIt e) const { return edges[e.n].target; }
+    Node bNode(InEdgeIt e) const { return edges[e.n].source; }
 
     NodeIt& first(NodeIt& v) const { 
@@ -152 +152 @@
       else {
         int n;
-        for(n=nodes[edges[it.n].head].next;
+        for(n=nodes[edges[it.n].target].next;
             n!=-1 && nodes[n].first_in == -1;
             n = nodes[n].next) ;
@@ -208 +208 @@
       }
       
-      edges[n].tail = u.n; edges[n].head = v.n;
+      edges[n].source = u.n; edges[n].target = v.n;
 
       edges[n].next_out = nodes[u.n].first_out;
@@ -233 +233 @@
       if(edges[n].prev_in!=-1)
         edges[edges[n].prev_in].next_in = edges[n].next_in;
-      else nodes[edges[n].head].first_in = edges[n].next_in;
+      else nodes[edges[n].target].first_in = edges[n].next_in;
       
       if(edges[n].next_out!=-1)
@@ -239 +239 @@
       if(edges[n].prev_out!=-1)
         edges[edges[n].prev_out].next_out = edges[n].next_out;
-      else nodes[edges[n].tail].first_out = edges[n].next_out;
+      else nodes[edges[n].source].first_out = edges[n].next_out;
       
       edges[n].next_in = first_free_edge;