Changeset 780:e06d0d16595f in lemon-0.x for src/test/bfs_test.cc

Timestamp:

09/01/04 17:08:41 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

• DFS class (bfs.h and bfs_test.cc) added
• Bugfixes in Dijkstra and Bfs

File:

• src/test/bfs_test.cc (modified) (1 diff)

src/test/bfs_test.cc

@@ -77 +77 @@
   }
 
-  ///\bug This works only for integer lengths
-  for(NodeIt v(G); v==INVALID; ++v)
-    if ( bfs_test.reached(v) ) {
+  for(NodeIt v(G); v==INVALID; ++v) {
+    check(bfs_test.reached(v),"Each node should be reached.");
+    if ( bfs_test.pred(v)!=INVALID ) {
       Edge e=bfs_test.pred(v);
       Node u=G.tail(e);
+      check(u==bfs_test.predNode(v),"Wrong tree.");
       check(bfs_test.dist(v) - bfs_test.dist(u) == 1,
-            "Bad shortest path tree edge! Difference: " 
+            "Wrong distance. Difference: " 
             << std::abs(bfs_test.dist(v) - bfs_test.dist(u) 
                         - 1));
     }
+  }
 }
+