Changeset 549:5531429143bc in lemon-0.x for src/work/marci/bfs_dfs_misc.h

Timestamp:

05/06/04 17:10:48 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

 

File:

• src/work/marci/bfs_dfs_misc.h (modified) (2 diffs)

src/work/marci/bfs_dfs_misc.h

@@ -20 +20 @@
       if (!reached[n]) {
         bfs.pushAndSetReached(n);
-        bool_map.set(n, false) {
-          while (!bfs.finished()) {
-            if (bfs.isBNodeNewlyReached()) {
-              bool_map.set(bfs.bNode())=!bfs.aNode();
-            } else {
-              if (bool_map[bfs.bNode()]==bool_map[bfs.aNode()]) {
-                return false;
-              }
+        bool_map.set(n, false);
+        while (!bfs.finished()) {
+          if (bfs.isBNodeNewlyReached()) {
+            bool_map.set(bfs.bNode())=!bfs.aNode();
+          } else {
+            if (bool_map[bfs.bNode()]==bool_map[bfs.aNode()]) {
+              return false;
             }
-            ++bfs;
           }
+          ++bfs;
         }
       }
     }
+    
     return true;
   }
@@ -39 +39 @@
   /// experimental topsort, 
   /// I think the final version will work as an iterator
+  /// if the graph is not a acyclic, the na pre-topological order is obtained 
+  /// (see Schrijver's book)
   template<typename Graph> 
-  void topSort(Graph& g, std::list<typename Graph::Node>& l) {
+  void topSort(const Graph& g, std::list<typename Graph::Node>& l) {
     l.clear();
     typedef typename Graph::template NodeMap<bool> ReachedMap;