Changeset 585:87c34740a0ec in lemon-0.x for src/test

Timestamp:

05/08/04 18:00:57 (21 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Some more test cases.

File:

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

src/test/dijkstra_test.cc

@@ -74 +74 @@
   
   check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
-  
+
+
+  for(EdgeIt e(G); G.valid(e); G.next(e)) {
+    Node u=G.tail(e);
+    Node v=G.head(e);
+    check( !dijkstra_test.reached(u) ||
+           (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
+           "dist(head)-dist(tail)- edge_length= " 
+           << dijkstra_test.dist(v) - dijkstra_test.dist(u) 
+           - cap[e]);
+  }
+
+  ///\bug This works only for integer lengths
+  for(NodeIt v(G); G.valid(v); G.next(v))
+    if ( dijkstra_test.reached(v) ) {
+      Edge e=dijkstra_test.pred(v);
+      Node u=G.tail(e);
+      check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
+            "Bad shortest path tree edge! Difference: " 
+            << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) 
+                            - cap[e]));
+    }
 }