Changeset 986:e997802b855c in lemon-0.x for src/test/dijkstra_heap_test.cc

Timestamp:

11/13/04 13:53:28 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Naming changes:

• head -> target
• tail -> source

File:

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

src/test/dijkstra_heap_test.cc

@@ -74 +74 @@
   EdgeIt e;
   for(G.first(e); e!=INVALID; ++e) {
-    Node u=G.tail(e);
-    Node v=G.head(e);
+    Node u=G.source(e);
+    Node v=G.target(e);
     if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) > cap[e] )
       if ( dijkstra_test.reached(u) ) {
-        std::cout<<"Error! dist(head)-dist(tail)- edge_length= " 
+        std::cout<<"Error! dist(target)-dist(source)- edge_length= " 
                  <<dijkstra_test.dist(v) - dijkstra_test.dist(u) 
           - cap[e]<<std::endl;
@@ -89 +89 @@
     if ( dijkstra_test.reached(v) ) {
       Edge e=dijkstra_test.pred(v);
-      Node u=G.tail(e);
+      Node u=G.source(e);
       if ( dijkstra_test.dist(v) - dijkstra_test.dist(u) != cap[e] ) {
         std::cout<<"Error in a shortest path tree edge! Difference: " 
@@ -123 +123 @@
 
   for(G.first(e); e!=INVALID; ++e) {
-    Node u=G.tail(e);
-    Node v=G.head(e);
+    Node u=G.source(e);
+    Node v=G.target(e);
     if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) > cap[e] )
       if ( dijkstra_test2.reached(u) ) {
-        std::cout<<"Error! dist(head)-dist(tail)- edge_length= " 
+        std::cout<<"Error! dist(target)-dist(source)- edge_length= " 
                  <<dijkstra_test2.dist(v) - dijkstra_test2.dist(u) 
           - cap[e]<<std::endl;
@@ -137 +137 @@
     if ( dijkstra_test2.reached(v) ) {
       Edge e=dijkstra_test2.pred(v);
-      Node u=G.tail(e);
+      Node u=G.source(e);
       if ( dijkstra_test2.dist(v) - dijkstra_test2.dist(u) != cap[e] ) {
         std::cout<<"Error in a shortest path tree edge! Difference: "