Index: src/work/alpar/dijkstra/bin_heap.hh
===================================================================
--- src/work/alpar/dijkstra/bin_heap.hh	(revision 224)
+++ src/work/alpar/dijkstra/bin_heap.hh	(revision 242)
@@ -59,4 +59,7 @@
 #ifndef BIN_HEAP_HH
 #define BIN_HEAP_HH
+
+///\file
+///\brief Binary Heap implementation.
 
 #include <vector>
Index: src/work/alpar/dijkstra/dijkstra.h
===================================================================
--- src/work/alpar/dijkstra/dijkstra.h	(revision 229)
+++ src/work/alpar/dijkstra/dijkstra.h	(revision 242)
@@ -1,3 +1,4 @@
 // -*- C++ -*-
+
 /* 
  *template <Graph, T, Heap=FibHeap, LengthMap=Graph::EdgeMap<T> >
@@ -26,4 +27,7 @@
 #ifndef HUGO_DIJKSTRA_H
 #define HUGO_DIJKSTRA_H
+
+///\file
+///\brief Dijkstra algorithm.
 
 #include <fib_heap.h>
@@ -44,14 +48,23 @@
   ///The type of the length is determined by the \c ValueType of the length map.
   ///
-  ///It is also posible to change the underlying priority heap.
+  ///It is also possible to change the underlying priority heap.
   ///
   ///\param Graph The graph type the algorithm runs on.
-  ///\param LengthMap This read-only EdgeMap determines the
+  ///\param LengthMap This read-only
+  ///EdgeMap
+  ///determines the
   ///lengths of the edges. It is read once for each edge, so the map
   ///may involve in relatively time consuming process to compute the edge
-  ///length if it is necessary.
+  ///length if it is necessary. The default map type is
+  ///\ref GraphSkeleton::EdgeMap "Graph::EdgeMap<int>"
   ///\param Heap The heap type used by the %Dijkstra
   ///algorithm. The default
   ///is using \ref BinHeap "binary heap".
+  
+#ifdef DOXYGEN
+  template <typename Graph,
+	    typename LengthMap,
+	    typename Heap>
+#else
   template <typename Graph,
 	    typename LengthMap=typename Graph::EdgeMap<int>,
@@ -59,4 +72,5 @@
 				   typename LengthMap::ValueType, 
 				   typename Graph::NodeMap<int> > >
+#endif
   class Dijkstra{
   public:
@@ -136,5 +150,5 @@
     //    bool reached(Node v) { return reach[v]; }
 
-    ///Chechs if a node is reachable from the source.
+    ///Checks if a node is reachable from the source.
 
     ///Returns \c true if \c v is reachable from the source.
Index: src/work/alpar/dijkstra/fib_heap.h
===================================================================
--- src/work/alpar/dijkstra/fib_heap.h	(revision 224)
+++ src/work/alpar/dijkstra/fib_heap.h	(revision 242)
@@ -52,4 +52,7 @@
 #define FIB_HEAP_H
 
+///\file
+///\brief Fibonacci Heap implementation.
+
 #include <vector>
 #include <functional>
@@ -74,5 +77,5 @@
 
     ///\todo It is use nowhere
-    ///\todo It doesn't conforms to the naming conventions.
+    ///\todo It doesn't conform to the naming conventions.
   public:
     enum state_enum {