Changeset 986:e997802b855c in lemon-0.x for src/demo

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

Location:

src/demo

Files:

• dim_to_dot.cc (modified) (1 diff)
• sub_graph_wrapper_demo.cc (modified) (2 diffs)
• tight_edge_filter_map.h (modified) (2 diffs)

src/demo/dim_to_dot.cc

@@ -52 +52 @@
   cout << "  edge [ shape=ellipse, fontname=Helvetica, fontsize=10 ];" << endl;
   for(EdgeIt e(g); e!=INVALID; ++e) {
-    cout << "  n" << g.id(g.tail(e)) << " -> " << " n" << g.id(g.head(e))
+    cout << "  n" << g.id(g.source(e)) << " -> " << " n" << g.id(g.target(e))
          << " [ label=\"" << g.id(e) 
          << ", length:" << length[e] << "\" ]; " << endl;

src/demo/sub_graph_wrapper_demo.cc

@@ -38 +38 @@
   readDimacs(std::cin, g, length, s, t);
 
-  cout << "edges with lengths (of form id, tail--length->head): " << endl;
+  cout << "edges with lengths (of form id, source--length->target): " << endl;
   for(EdgeIt e(g); e!=INVALID; ++e) 
-    cout << " " << g.id(e) << ", " << g.id(g.tail(e)) << "--" 
-         << length[e] << "->" << g.id(g.head(e)) << endl;
+    cout << " " << g.id(e) << ", " << g.id(g.source(e)) << "--" 
+         << length[e] << "->" << g.id(g.target(e)) << endl;
 
   cout << "s: " << g.id(s) << " t: " << g.id(t) << endl;
@@ -76 +76 @@
     if (flow[e])
       cout << " " << g.id(e) << ", "
-           << g.id(g.tail(e)) << "--" 
-           << length[e] << "->" << g.id(g.head(e)) << endl;
+           << g.id(g.source(e)) << "--" 
+           << length[e] << "->" << g.id(g.target(e)) << endl;
 }

src/demo/tight_edge_filter_map.h

@@ -32 +32 @@
   /// A node-map node_potential is said to be a potential w.r.t. 
   /// an edge-map edge_distance 
-  /// if and only if for each edge e, node_potential[g.head(e)] 
-  /// <= edge_distance[e]+node_potential[g.tail(e)] 
+  /// if and only if for each edge e, node_potential[g.target(e)] 
+  /// <= edge_distance[e]+node_potential[g.source(e)] 
   /// (or the reverse inequality holds for each edge).
   /// An edge is said to be tight if this inequality holds with equality, 
@@ -52 +52 @@
       edge_distance(&_edge_distance) { }
     bool operator[](const typename Graph::Edge& e) const {
-      return ((*node_potential)[g->head(e)] == 
-              (*edge_distance)[e]+(*node_potential)[g->tail(e)]);
+      return ((*node_potential)[g->target(e)] == 
+              (*edge_distance)[e]+(*node_potential)[g->source(e)]);
     }
   };