1.1 --- a/src/hugo/dijkstra.h	Tue Jul 06 09:34:25 2004 +0000
     1.2 +++ b/src/hugo/dijkstra.h	Tue Jul 06 09:52:04 2004 +0000
     1.3 @@ -38,7 +38,7 @@
     1.4    ///is using \ref BinHeap "binary heap".
     1.5    ///
     1.6    ///\author Jacint Szabo and Alpar Juttner
     1.7 -  ///\todo We need a typedef-names should be standardized.
     1.8 +  ///\todo We need a typedef-names should be standardized. (-:
     1.9  
    1.10  #ifdef DOXYGEN
    1.11    template <typename GR,
    1.12 @@ -60,15 +60,15 @@
    1.13      
    1.14      ///The type of the length of the edges.
    1.15      typedef typename LM::ValueType ValueType;
    1.16 -    ///The the type of the map that stores the edge lengths.
    1.17 +    ///The type of the map that stores the edge lengths.
    1.18      typedef LM LengthMap;
    1.19 -    ///\brief The the type of the map that stores the last
    1.20 +    ///\brief The type of the map that stores the last
    1.21      ///edges of the shortest paths.
    1.22      typedef typename Graph::template NodeMap<Edge> PredMap;
    1.23 -    ///\brief The the type of the map that stores the last but one
    1.24 +    ///\brief The type of the map that stores the last but one
    1.25      ///nodes of the shortest paths.
    1.26      typedef typename Graph::template NodeMap<Node> PredNodeMap;
    1.27 -    ///The the type of the map that stores the dists of the nodes.
    1.28 +    ///The type of the map that stores the dists of the nodes.
    1.29      typedef typename Graph::template NodeMap<ValueType> DistMap;
    1.30  
    1.31    private: