Changeset 59:41c7f9c09a12 in lemon-0.x for src/work/iterator_bfs_dfs_demo.cc

Timestamp:

02/04/04 13:46:33 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

.

File:

• src/work/iterator_bfs_dfs_demo.cc (modified) (1 diff)

src/work/iterator_bfs_dfs_demo.cc

@@ -182 +182 @@
   }
   
+  {
+    std::cout << "iterator bfs demo 2 ..." << std::endl;
+    //ListGraph::NodeMap<bool> reached(G, false);
+    //reached.set(s, true);
+    //std::queue<ListGraph::OutEdgeIt> bfs_queue;
+    //bfs_queue.push(G.first<OutEdgeIt>(s));
+    BfsIterator2< ListGraph, ListGraph::OutEdgeIt, ListGraph::NodeMap<bool> > bfs(G);
+    bfs.pushAndSetReached(s);
+    while (!bfs.finished()) {
+      if (OutEdgeIt(bfs).valid()) {
+        std::cout << "OutEdgeIt: " << bfs; 
+        std::cout << " aNode: " << G.aNode(bfs); 
+        std::cout << " bNode: " << G.bNode(bfs) << " ";
+      } else { 
+        std::cout << "OutEdgeIt: " << "invalid"; 
+        std::cout << " aNode: " << G.aNode(bfs); 
+        std::cout << " bNode: " << "invalid" << " ";
+      }
+      if (bfs.isBNodeNewlyReached()) { 
+        std::cout << "bNodeIsNewlyReached ";
+      } else { 
+        std::cout << "bNodeIsNotNewlyReached ";
+      } 
+      if (bfs.isANodeExamined()) { 
+        std::cout << "aNodeIsExamined ";
+      } else { 
+        std::cout << "aNodeIsNotExamined ";
+      } 
+      std::cout<<std::endl;
+      ++bfs;
+    }
+  }
+  
+
+
 
   {