Changeset 569:3b6afd33c221 in lemon-0.x for src/work/marci

Timestamp:

05/07/04 09:44:44 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@744

Message:

BidirGraphWrapper?<Graph>, the map values are different for the opposite edges.

File:

• src/work/marci/iterator_bfs_demo.cc (modified) (1 diff)

src/work/marci/iterator_bfs_demo.cc

@@ -315 +315 @@
   }
 
+
+
+  {
+    typedef BidirGraphWrapper<const Graph> GW;
+    GW gw(G);
+    
+    EdgeNameMap< GW, Graph::NodeMap<string> > edge_name(gw, node_name);
+    
+    cout << "bfs and dfs iterator demo on the undirected graph" << endl;
+    for(GW::NodeIt n(gw); gw.valid(n); gw.next(n)) { 
+      cout << node_name[GW::Node(n)] << ": ";
+      cout << "out edges: ";
+      for(GW::OutEdgeIt e(gw, n); gw.valid(e); gw.next(e)) 
+        cout << edge_name[e] << " ";
+      cout << "in edges: ";
+      for(GW::InEdgeIt e(gw, n); gw.valid(e); gw.next(e)) 
+        cout << edge_name[e] << " ";
+      cout << endl;
+    }
+//     for(GW::EdgeIt e=gw.first<GW::EdgeIt>(); gw.valid(e); gw.next(e)) { 
+//       cout << edge_name.get(e) << " ";
+//     }
+//     cout << endl;
+
+    cout << "bfs from t ..." << endl;
+    BfsIterator< GW, GW::NodeMap<bool> > bfs(gw);
+    bfs.pushAndSetReached(t);
+    while (!bfs.finished()) {
+      //cout << "edge: ";
+      if (gw.valid(GW::OutEdgeIt(bfs))) {
+        cout << edge_name[GW::OutEdgeIt(bfs)] << /*endl*/", " << 
+          node_name[gw.aNode(bfs)] << 
+          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[gw.bNode(bfs)] << 
+          (bfs.isBNodeNewlyReached() ? ": is newly reached." : 
+           ": is not newly reached.");
+      } else { 
+        cout << "invalid" << /*endl*/", " << 
+          node_name[bfs.aNode()] << 
+          (bfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          
+          "invalid.";
+      }
+      cout << endl;
+      ++bfs;
+    }
+
+    cout << "    /-->    ------------->            "<< endl;
+    cout << "   / /-- v1 <-\\      /---- v3-\\      "<< endl;
+    cout << "  / |          |    /  /->     \\     "<< endl;
+    cout << " /  |          |   /  |    ^    \\  "<< endl;
+    cout << "s   |          |  /   |    |     \\->  t "<< endl;
+    cout << " \\  |          | /    |    |     /->  "<< endl;
+    cout << "  \\ |       --/ /     |    |    /     "<< endl;
+    cout << "   \\ \\-> v2 <--/       \\-- v4 -/      "<< endl;
+    cout << "    \\-->    ------------->         "<< endl;
+    
+    cout << "dfs from t ..." << endl;
+    DfsIterator< GW, GW::NodeMap<bool> > dfs(gw);
+    dfs.pushAndSetReached(t);
+    while (!dfs.finished()) {
+      ++dfs;
+      //cout << "edge: ";
+      if (gw.valid(GW::OutEdgeIt(dfs))) {
+        cout << edge_name[GW::OutEdgeIt(dfs)] << /*endl*/", " << 
+          node_name[gw.aNode(dfs)] << 
+          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          node_name[gw.bNode(dfs)] << 
+          (dfs.isBNodeNewlyReached() ? ": is newly reached." : 
+           ": is not newly reached.");
+      } else { 
+        cout << "invalid" << /*endl*/", " << 
+          node_name[dfs.aNode()] << 
+          (dfs.isANodeExamined() ? ": is examined, " : ": is not examined, ") << 
+          
+          "invalid.";
+      }
+      cout << endl;
+    }
+  }
+
+
+
   return 0;
 }