Changeset 1195:4d07dd56fa9a in lemon-0.x

Timestamp:

03/05/05 00:12:10 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

The source node is reported to be reaches but it has no previous node/edge.

File:

• src/test/dijkstra_heap_test.cc (modified) (3 diffs)

src/test/dijkstra_heap_test.cc

@@ -120 +120 @@
     if ( dijkstra_test.reached(v) ) {
       Edge e=dijkstra_test.pred(v);
-      Node u=graph.source(e);
-      if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) != cap[e] ) {
-        std::cout<<"Error in a shortest path tree edge! Difference: " 
-                 <<std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) 
-                            - cap[e])<<std::endl;
-        ++error2;
+      if(e!=INVALID) {
+        Node u=graph.source(e);
+        if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) != cap[e] ) {
+          std::cout<<"Error in a shortest path tree edge! Difference: " 
+                   <<std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u) 
+                              - cap[e])<<std::endl;
+          ++error2;
+        }
       }
     }
   }
-
+  
 
   
@@ -169 +171 @@
     if ( dijkstra_test2.reached(v) ) {
       Edge e=dijkstra_test2.pred(v);
-      Node u=graph.source(e);
-      if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) != cap[e] ) {
-        std::cout<<"Error in a shortest path tree edge! Difference: " 
-                 <<std::abs(dijkstra_test2.dist(v) - dijkstra_test2.dist(u) 
-                            - cap[e])<<std::endl;
-        ++error2;
+      if(e!=INVALID) {
+        Node u=graph.source(e);
+        if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) != cap[e] ) {
+          std::cout<<"Error in a shortest path tree edge! Difference: " 
+                   <<std::abs(dijkstra_test2.dist(v) - dijkstra_test2.dist(u) 
+                              - cap[e])<<std::endl;
+          ++error2;
+        }
       }
     }
   }
-
+  
 
   std::cout << error1 << " non-tree and " << error2 
@@ -216 +220 @@
     if ( dijkstra_test3.reached(v) ) {
       Edge e=dijkstra_test3.pred(v);
-      Node u=graph.source(e);
-      if ( dijkstra_test3.dist(v) - dijkstra_test3.dist(u) != cap[e] ) {
-        std::cout<<"Error in a shortest path tree edge! Difference: " 
-                 <<std::abs(dijkstra_test3.dist(v) - dijkstra_test3.dist(u) 
-                            - cap[e])<<std::endl;
-        ++error2;
+      if(e!=INVALID) {
+        Node u=graph.source(e);
+        if ( dijkstra_test3.dist(v) - dijkstra_test3.dist(u) != cap[e] ) {
+          std::cout<<"Error in a shortest path tree edge! Difference: " 
+                   <<std::abs(dijkstra_test3.dist(v) - dijkstra_test3.dist(u) 
+                              - cap[e])<<std::endl;
+          ++error2;
+        }
       }
     }
   }
-
+  
 
   std::cout << error1 << " non-tree and " << error2