Changeset 2335:27aa03cd3121 in lemon-0.x for test/all_pairs_shortest_path_test.cc

Timestamp:

01/08/07 11:39:59 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

New path concept and path structures

TODO: BellmanFord::negativeCycle()

File:

• test/all_pairs_shortest_path_test.cc (modified) (3 diffs)

test/all_pairs_shortest_path_test.cc

@@ -29 +29 @@
 
 #include <lemon/fib_heap.h>
+
+#include <lemon/path.h>
 
 #include <lemon/time_measure.h>
@@ -91 +93 @@
   }    
 
+  bool checked_path = false;
+
   for (NodeIt it(graph); it != INVALID; ++it) {
     for (NodeIt jt(graph); jt != INVALID; ++jt) {
@@ -98 +102 @@
             "Wrong connection in all pairs shortest path");
       if (johnson.connected(it, jt)) {
+        if (it != jt && !checked_path) {
+          {
+            Path<Graph> path = johnson.path(it, jt);
+            check(checkPath(graph, path), "Wrong path.");
+            check(pathSource(graph, path) == it, "Wrong path.");
+            check(pathTarget(graph, path) == jt, "Wrong path.");
+          }
+          {
+            Path<Graph> path = floyd.path(it, jt);
+            check(checkPath(graph, path), "Wrong path.");
+            check(pathSource(graph, path) == it, "Wrong path.");
+            check(pathTarget(graph, path) == jt, "Wrong path.");
+          }
+          checked_path = true;
+          std::cout << "Path checked" << std::endl;
+        }
         check(johnson.dist(it, jt) == floyd.dist(it, jt),
               "Wrong distance in all pairs shortest path");