Changeset 986:e997802b855c in lemon-0.x for src/work/alpar/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/alpar/graph.h (modified) (7 diffs)

src/work/alpar/graph.h

@@ -107 +107 @@
       // Lehet, hogy ez a ketto nem kell!!!
       
-      NodeIterator tail() const {NodeIterator i;i.G=G;i.n=e->From();return i;}
-      NodeIterator head() const {NodeIterator i;i.G=G;i.n=e->To();return i;}
+      NodeIterator source() const {NodeIterator i;i.G=G;i.n=e->From();return i;}
+      NodeIterator target() const {NodeIterator i;i.G=G;i.n=e->To();return i;}
       NodeIterator opposite(const NodeIterator &n) const
-      {return n==tail()?head():tail();}
+      {return n==source()?target():source();}
       
       bool valid() {return e;}
@@ -191 +191 @@
       {OutEdgeIterator tmp(*this); goNext(); return tmp;}
       
-      NodeIterator aNode() const {return tail();}
-      NodeIterator bNode() const {return head();}
+      NodeIterator aNode() const {return source();}
+      NodeIterator bNode() const {return target();}
       
       operator const InEdgeIterator ()
@@ -219 +219 @@
       
       NodeIterator aNode() const {return n;}
-      NodeIterator bNode() const {return n.n==tail().n?head():tail();}
+      NodeIterator bNode() const {return n.n==source().n?target():source();}
       
       operator const InEdgeIterator ()
@@ -255 +255 @@
       
       NodeIterator aNode() const {return n;}
-      NodeIterator bNode() const {return n.n==tail().n?head():tail();}
+      NodeIterator bNode() const {return n.n==source().n?target():source();}
       
       operator const EdgeIterator ()
@@ -464 +464 @@
     {
       return n?
-        reversed[n-1]?path[n-1].tail():path[n-1].head():
-        reversed[0]?path[0].head():path[0].tail();
+        reversed[n-1]?path[n-1].source():path[n-1].target():
+        reversed[0]?path[0].target():path[0].source();
     }
     void setRevert(int n,bool r=true) {reversed[n]=r;}
@@ -471 +471 @@
     {
       path[n]=i;
-      reversed[n] = i.head()==i.aNode();
+      reversed[n] = i.target()==i.aNode();
     }
     void setEdge(int n,EdgeIterator i,bool r)
@@ -479 +479 @@
     }
 
-    NodeIterator tail() { return getNode(0); }
-    NodeIterator head() { return getNode(getLength()); }
+    NodeIterator source() { return getNode(0); }
+    NodeIterator target() { return getNode(getLength()); }
   };