[Lemon-commits] [lemon_svn] alpar: r1549 - hugo/trunk/src/test

Lemon SVN svn at lemon.cs.elte.hu
Mon Nov 6 20:46:08 CET 2006


Author: alpar
Date: Tue Feb 15 15:58:32 2005
New Revision: 1549

Modified:
   hugo/trunk/src/test/dijkstra_test.cc

Log:
Test the new dijkstra features.

Modified: hugo/trunk/src/test/dijkstra_test.cc
==============================================================================
--- hugo/trunk/src/test/dijkstra_test.cc	(original)
+++ hugo/trunk/src/test/dijkstra_test.cc	Tue Feb 15 15:58:32 2005
@@ -17,6 +17,7 @@
 #include "test_tools.h"
 #include <lemon/smart_graph.h>
 #include <lemon/dijkstra.h>
+#include <lemon/maps.h>
 #include <lemon/concept/graph.h>
 #include <lemon/concept/maps.h>
 using namespace lemon;
@@ -44,7 +45,7 @@
   bool b;
   DType::DistMap d(G);
   DType::PredMap p(G);
-  DType::PredNodeMap pn(G);
+  //  DType::PredNodeMap pn(G);
   LengthMap cap;
 
   DType dijkstra_test(G,cap);
@@ -56,9 +57,9 @@
   n  = dijkstra_test.predNode(n);
   d  = dijkstra_test.distMap();
   p  = dijkstra_test.predMap();
-  pn = dijkstra_test.predNodeMap();
+  //  pn = dijkstra_test.predNodeMap();
   b  = dijkstra_test.reached(n);
-
+  
 }
 
 int main()
@@ -115,5 +116,11 @@
 			    - cap[e]));
     }
   }
-}
 
+  
+  {
+    NullMap<Node,Node> myPredNodeMap;
+    dijkstra(G,cap).predNodeMap(myPredNodeMap).run(s);
+  }
+  return 0;
+}



More information about the Lemon-commits mailing list