Changeset 986:e997802b855c in lemon-0.x for src/work/marci/iterator_bfs_demo.cc

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/marci/iterator_bfs_demo.cc (modified) (8 diffs)

src/work/marci/iterator_bfs_demo.cc

@@ -24 +24 @@
   string operator[](typename Graph::Edge e) const { 
     return 
-      (node_name_map[graph.tail(e)]+"->"+node_name_map[graph.head(e)]);
+      (node_name_map[graph.source(e)]+"->"+node_name_map[graph.target(e)]);
   }
 };
@@ -96 +96 @@
       if (Graph::Edge(bfs)!=INVALID) {
         cout << edge_name[bfs] << /*endl*/", " << 
-          node_name[G.tail(bfs)] << 
-          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
-          node_name[G.head(bfs)] << 
+          node_name[G.source(bfs)] << 
+          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[G.target(bfs)] << 
           (bfs.isBNodeNewlyReached() ? ": is newly reached." : 
            ": is not newly reached.");
       } else { 
         cout << "invalid" << /*endl*/", " << 
-          node_name[bfs.tail()] << 
+          node_name[bfs.source()] << 
           (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
           
@@ -130 +130 @@
       if (Graph::Edge(dfs)!=INVALID) {
         cout << edge_name[dfs] << /*endl*/", " << 
-          node_name[G.tail(dfs)] << 
-          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
-          node_name[G.head(dfs)] << 
+          node_name[G.source(dfs)] << 
+          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[G.target(dfs)] << 
           (dfs.isBNodeNewlyReached() ? ": is newly reached." : 
            ": is not newly reached.");
       } else { 
         cout << "invalid" << /*endl*/", " << 
-          node_name[dfs.tail()] << 
+          node_name[dfs.source()] << 
           (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
           
@@ -172 +172 @@
       if (GW::Edge(bfs)!=INVALID) {
         cout << edge_name[GW::Edge(bfs)] << /*endl*/", " << 
-          node_name[gw.tail(bfs)] << 
-          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
-          node_name[gw.head(bfs)] << 
+          node_name[gw.source(bfs)] << 
+          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[gw.target(bfs)] << 
           (bfs.isBNodeNewlyReached() ? ": is newly reached." : 
            ": is not newly reached.");
       } else { 
         cout << "invalid" << /*endl*/", " << 
-          node_name[bfs.tail()] << 
+          node_name[bfs.source()] << 
           (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
           
@@ -206 +206 @@
       if (GW::Edge(dfs)!=INVALID) {
         cout << edge_name[GW::Edge(dfs)] << /*endl*/", " << 
-          node_name[gw.tail(dfs)] << 
-          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
-          node_name[gw.head(dfs)] << 
+          node_name[gw.source(dfs)] << 
+          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[gw.target(dfs)] << 
           (dfs.isBNodeNewlyReached() ? ": is newly reached." : 
            ": is not newly reached.");
       } else { 
         cout << "invalid" << /*endl*/", " << 
-          node_name[dfs.tail()] << 
+          node_name[dfs.source()] << 
           (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
           
@@ -311 +311 @@
     cout << "bfs and dfs iterator demo on the bidirected graph" << endl;
 //     for(GW::EdgeIt e(gw); e!=INVALID; ++e) {
-//       cout << node_name[gw.tail(e)] << "->" << node_name[gw.head(e)] << " ";
+//       cout << node_name[gw.source(e)] << "->" << node_name[gw.target(e)] << " ";
 //     } 
     for(GW::NodeIt n(gw); n!=INVALID; ++n) { 
@@ -335 +335 @@
       if (GW::Edge(bfs)!=INVALID) {
         cout << edge_name[GW::Edge(bfs)] << /*endl*/", " << 
-          node_name[gw.tail(bfs)] << 
-          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
-          node_name[gw.head(bfs)] << 
+          node_name[gw.source(bfs)] << 
+          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[gw.target(bfs)] << 
           (bfs.isBNodeNewlyReached() ? ": is newly reached." : 
            ": is not newly reached.");
       } else { 
         cout << "invalid" << /*endl*/", " << 
-          node_name[bfs.tail()] << 
+          node_name[bfs.source()] << 
           (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
           
@@ -369 +369 @@
       if (GW::Edge(dfs)!=INVALID) {
         cout << edge_name[GW::Edge(dfs)] << /*endl*/", " << 
-          node_name[gw.tail(dfs)] << 
-          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
-          node_name[gw.head(dfs)] << 
+          node_name[gw.source(dfs)] << 
+          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[gw.target(dfs)] << 
           (dfs.isBNodeNewlyReached() ? ": is newly reached." : 
            ": is not newly reached.");
       } else { 
         cout << "invalid" << /*endl*/", " << 
-          node_name[dfs.tail()] << 
+          node_name[dfs.source()] << 
           (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") <<