1.1 --- a/lemon/dijkstra.h	Sun Jul 13 19:51:02 2008 +0100
     1.2 +++ b/lemon/dijkstra.h	Sun Jul 13 20:09:47 2008 +0100
     1.3 @@ -173,7 +173,8 @@
     1.4      ///Instantiates a DistMap.
     1.5  
     1.6      ///This function instantiates a \ref DistMap.
     1.7 -    ///\param G is the digraph, to which we would like to define the \ref DistMap
     1.8 +    ///\param G is the digraph, to which we would like to define
     1.9 +    ///the \ref DistMap
    1.10      static DistMap *createDistMap(const GR &G)
    1.11      {
    1.12        return new DistMap(G);
    1.13 @@ -336,8 +337,8 @@
    1.14      ///
    1.15      template <class T>
    1.16      struct DefPredMap
    1.17 -      : public Dijkstra< Digraph,        LengthMap, DefPredMapTraits<T> > {
    1.18 -      typedef Dijkstra< Digraph,        LengthMap, DefPredMapTraits<T> > Create;
    1.19 +      : public Dijkstra< Digraph, LengthMap, DefPredMapTraits<T> > {
    1.20 +      typedef Dijkstra< Digraph, LengthMap, DefPredMapTraits<T> > Create;
    1.21      };
    1.22  
    1.23      template <class T>
    1.24 @@ -372,8 +373,8 @@
    1.25      ///
    1.26      template <class T>
    1.27      struct DefProcessedMap
    1.28 -      : public Dijkstra< Digraph,        LengthMap, DefProcessedMapTraits<T> > {
    1.29 -      typedef Dijkstra< Digraph,        LengthMap, DefProcessedMapTraits<T> > Create;
    1.30 +      : public Dijkstra< Digraph, LengthMap, DefProcessedMapTraits<T> > {
    1.31 +      typedef Dijkstra< Digraph, LengthMap, DefProcessedMapTraits<T> > Create;
    1.32      };
    1.33  
    1.34      struct DefDigraphProcessedMapTraits : public Traits {
    1.35 @@ -392,7 +393,8 @@
    1.36      template <class T>
    1.37      struct DefProcessedMapToBeDefaultMap
    1.38        : public Dijkstra< Digraph, LengthMap, DefDigraphProcessedMapTraits> {
    1.39 -      typedef Dijkstra< Digraph, LengthMap, DefDigraphProcessedMapTraits> Create;
    1.40 +      typedef Dijkstra< Digraph, LengthMap, DefDigraphProcessedMapTraits>
    1.41 +      Create;
    1.42      };
    1.43  
    1.44      template <class H, class CR>
    1.45 @@ -415,8 +417,8 @@
    1.46      ///
    1.47      template <class H, class CR = typename Digraph::template NodeMap<int> >
    1.48      struct DefHeap
    1.49 -      : public Dijkstra< Digraph,        LengthMap, DefHeapTraits<H, CR> > {
    1.50 -      typedef Dijkstra< Digraph,        LengthMap, DefHeapTraits<H, CR> > Create;
    1.51 +      : public Dijkstra< Digraph, LengthMap, DefHeapTraits<H, CR> > {
    1.52 +      typedef Dijkstra< Digraph, LengthMap, DefHeapTraits<H, CR> > Create;
    1.53      };
    1.54  
    1.55      template <class H, class CR>
    1.56 @@ -440,8 +442,8 @@
    1.57      ///parameter and the heap's constructor waits for the cross reference.
    1.58      template <class H, class CR = typename Digraph::template NodeMap<int> >
    1.59      struct DefStandardHeap
    1.60 -      : public Dijkstra< Digraph,        LengthMap, DefStandardHeapTraits<H, CR> > {
    1.61 -      typedef Dijkstra< Digraph,        LengthMap, DefStandardHeapTraits<H, CR> >
    1.62 +      : public Dijkstra< Digraph, LengthMap, DefStandardHeapTraits<H, CR> > {
    1.63 +      typedef Dijkstra< Digraph, LengthMap, DefStandardHeapTraits<H, CR> >
    1.64        Create;
    1.65      };
    1.66  
    1.67 @@ -976,7 +978,8 @@
    1.68      ///Instantiates a DistMap.
    1.69  
    1.70      ///This function instantiates a \ref DistMap.
    1.71 -    ///\param g is the digraph, to which we would like to define the \ref DistMap
    1.72 +    ///\param g is the digraph, to which we would like to define
    1.73 +    ///the \ref DistMap
    1.74  #ifdef DOXYGEN
    1.75      static DistMap *createDistMap(const GR &g)
    1.76  #else