# HG changeset patch
# User alpar
# Date 1083916937 0
# Node ID eec0a62979c973ebdb6ec819b9bf54c09f5787bb
# Parent  3b6afd33c221ef63a7977d10e3ddb1fcf264eaa4
Compile checks added.

diff -r 3b6afd33c221 -r eec0a62979c9 src/hugo/dijkstra.h
--- a/src/hugo/dijkstra.h	Fri May 07 07:44:44 2004 +0000
+++ b/src/hugo/dijkstra.h	Fri May 07 08:02:17 2004 +0000
@@ -38,6 +38,7 @@
   ///is using \ref BinHeap "binary heap".
   ///
   ///\author Jacint Szabo
+  ///\todo We need a LengthMap typedef
 #ifdef DOXYGEN
   template <typename Graph,
 	    typename LengthMap,
diff -r 3b6afd33c221 -r eec0a62979c9 src/test/dijkstra_test.cc
--- a/src/test/dijkstra_test.cc	Fri May 07 07:44:44 2004 +0000
+++ b/src/test/dijkstra_test.cc	Fri May 07 08:02:17 2004 +0000
@@ -6,6 +6,44 @@
 
 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()
 {
     
@@ -20,7 +58,6 @@
   Graph G;
   Node s, t;
   LengthMap cap(G);
-
   PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
   
   for(int i=0;i<PET_SIZE;i++) {
@@ -38,4 +75,3 @@
   check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
   
 }
-