Changeset 793:9cd0aeea47b0 in lemon-0.x for src/test/dijkstra_test.cc

Timestamp:

09/03/04 11:41:50 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

• BFD/DFS/Dijkstra compile test is done with skeleton::GraphSkeleton? graph and skeleton::ReadMap?.
• 'skeleton::' is explicitely written instead of 'using namespace ...' in graph_test.cc
• Output messages of type "makeRep(3)..." in unionfind_test.cc have been changed in order not to confuse compiler output parsers.

File:

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

src/test/dijkstra_test.cc

@@ -2 +2 @@
 #include <hugo/smart_graph.h>
 #include <hugo/dijkstra.h>
-
+#include<hugo/skeletons/graph.h>
+#include<hugo/skeletons/maps.h>
 using namespace hugo;
 
@@ -8 +9 @@
 
 
-void check_Dijkstra_SmartGraph_BinHeap_Compile() 
+void check_Dijkstra_BinHeap_Compile() 
 {
   typedef int VType;
-  typedef SmartGraph Graph;
+  typedef skeleton::StaticGraphSkeleton Graph;
 
   typedef Graph::Edge Edge;
@@ -17 +18 @@
   typedef Graph::EdgeIt EdgeIt;
   typedef Graph::NodeIt NodeIt;
-  typedef Graph::EdgeMap<VType> LengthMap;
+  typedef skeleton::ReadMap<Edge,VType> LengthMap;
  
   typedef Dijkstra<Graph, LengthMap> DType;
@@ -29 +30 @@
   DType::PredMap p(G);
   DType::PredNodeMap pn(G);
-  LengthMap cap(G);
+  LengthMap cap;
 
   DType dijkstra_test(G,cap);