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

src/lemon/smart_graph.h

@@ -56 +56 @@
     struct EdgeT 
     {
-      int head, tail, next_in, next_out;      
+      int target, source, next_in, next_out;      
       //FIXME: is this necessary?
       EdgeT() : next_in(-1), next_out(-1) {}  
@@ -98 +98 @@
     int maxId(Edge = INVALID) const { return edges.size()-1; }
 
-    Node tail(Edge e) const { return edges[e.n].tail; }
-    Node head(Edge e) const { return edges[e.n].head; }
+    Node source(Edge e) const { return edges[e.n].source; }
+    Node target(Edge e) const { return edges[e.n].target; }
 
     /// Node ID.
@@ -128 +128 @@
     Edge addEdge(Node u, Node v) {
       Edge e; e.n=edges.size(); edges.push_back(EdgeT()); //FIXME: Hmmm...
-      edges[e.n].tail=u.n; edges[e.n].head=v.n;
+      edges[e.n].source=u.n; edges[e.n].target=v.n;
       edges[e.n].next_out=nodes[u.n].first_out;
       edges[e.n].next_in=nodes[v.n].first_in;
@@ -212 +212 @@
     {
       int e = (prev.n==-1)? nodes[u.n].first_out : edges[prev.n].next_out;
-      while(e!=-1 && edges[e].tail!=v.n) e = edges[e].next_out;
+      while(e!=-1 && edges[e].source!=v.n) e = edges[e].next_out;
       prev.n=e;
       return prev;
@@ -308 +308 @@
       while(s.edge_num>edges.size()) {
         edge_observers.erase(Edge(edges.size()-1));
-        nodes[edges.back().head].first_in=edges.back().next_in;
-        nodes[edges.back().tail].first_out=edges.back().next_out;
+        nodes[edges.back().target].first_in=edges.back().next_in;
+        nodes[edges.back().source].first_out=edges.back().next_out;
         edges.pop_back();
       }