Changeset 570:eec0a62979c9 in lemon-0.x

Timestamp:

05/07/04 10:02:17 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Compile checks added.

Location:

src

Files:

• hugo/dijkstra.h (modified) (1 diff)
• test/dijkstra_test.cc (modified) (3 diffs)

src/hugo/dijkstra.h

@@ -39 +39 @@
   ///
   ///\author Jacint Szabo
+  ///\todo We need a LengthMap typedef
 #ifdef DOXYGEN
   template <typename Graph,

src/test/dijkstra_test.cc

@@ -6 +6 @@
 
 const int PET_SIZE =5;
+
+
+void check_Dijkstra_SmartGraph_BinHeap_Compile() 
+{
+  typedef int VType;
+  typedef SmartGraph Graph;
+
+  typedef Graph::Edge Edge;
+  typedef Graph::Node Node;
+  typedef Graph::EdgeIt EdgeIt;
+  typedef Graph::NodeIt NodeIt;
+  typedef Graph::EdgeMap<VType> LengthMap;
+ 
+  typedef Dijkstra<Graph, LengthMap> DType;
+  
+  Graph G;
+  Node n;
+  Edge e;
+  VType l;
+  bool b;
+  DType::DistMap d(G);
+  DType::PredMap p(G);
+  DType::PredNodeMap pn(G);
+  LengthMap cap(G);
+
+  DType dijkstra_test(G,cap);
+
+  dijkstra_test.run(n);
+
+  l  = dijkstra_test.dist(n);
+  e  = dijkstra_test.pred(n);
+  n  = dijkstra_test.predNode(n);
+  d  = dijkstra_test.distMap();
+  p  = dijkstra_test.predMap();
+  pn = dijkstra_test.predNodeMap();
+  b  = dijkstra_test.reached(n);
+
+}
 
 int main()
@@ -21 +59 @@
   Node s, t;
   LengthMap cap(G);
-
   PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
   
@@ -39 +76 @@
   
 }
-