1.1 --- a/src/lemon/dijkstra.h	Fri Feb 18 14:46:04 2005 +0000
     1.2 +++ b/src/lemon/dijkstra.h	Fri Feb 18 16:40:48 2005 +0000
     1.3 @@ -87,7 +87,8 @@
     1.4      ///Instantiates a PredNodeMap.
     1.5      
     1.6      ///This function instantiates a \ref PredNodeMap. 
     1.7 -    ///\param G is the graph, to which we would like to define the \ref PredNodeMap
     1.8 +    ///\param G is the graph, to which
     1.9 +    ///we would like to define the \ref PredNodeMap
    1.10      static PredNodeMap *createPredNodeMap(const GR &G)
    1.11      {
    1.12        return new PredNodeMap();
    1.13 @@ -104,7 +105,8 @@
    1.14      ///Instantiates a ReachedMap.
    1.15   
    1.16      ///This function instantiates a \ref ReachedMap. 
    1.17 -    ///\param G is the graph, to which we would like to define the \ref ReachedMap
    1.18 +    ///\param G is the graph, to which
    1.19 +    ///we would like to define the \ref ReachedMap
    1.20      static ReachedMap *createReachedMap(const GR &G)
    1.21      {
    1.22        return new ReachedMap();
    1.23 @@ -455,7 +457,7 @@
    1.24    public:
    1.25      ///\name Excetution control
    1.26      ///The simplest way to execute the algorithm is to use
    1.27 -    ///\ref run().
    1.28 +    ///one of the member functions called \c run(...).
    1.29      ///\n
    1.30      ///It you need more control on the execution,
    1.31      ///first you must call \ref init(), then you can add several source nodes
    1.32 @@ -753,7 +755,8 @@
    1.33  
    1.34      /// Constructor.
    1.35      
    1.36 -    /// This constructor requires some parameters, listed in the parameters list.
    1.37 +    /// This constructor requires some parameters,
    1.38 +    /// listed in the parameters list.
    1.39      /// Others are initiated to 0.
    1.40      /// \param g is the initial value of  \ref _g
    1.41      /// \param l is the initial value of  \ref _length
    1.42 @@ -862,9 +865,11 @@
    1.43        DefPredMapBase(const Base &b) : Base(b) {}
    1.44      };
    1.45      
    1.46 -    /// \ref named-templ-param "Named parameter" function for setting PredMap type
    1.47 -
    1.48 -    /// \ref named-templ-param "Named parameter" function for setting PredMap type
    1.49 +    ///\brief \ref named-templ-param "Named parameter"
    1.50 +    ///function for setting PredMap type
    1.51 +    ///
    1.52 +    /// \ref named-templ-param "Named parameter"
    1.53 +    ///function for setting PredMap type
    1.54      ///
    1.55      template<class T>
    1.56      DijkstraWizard<DefPredMapBase<T> > predMap(const T &t) 
    1.57 @@ -881,9 +886,11 @@
    1.58        DefPredNodeMapBase(const Base &b) : Base(b) {}
    1.59      };
    1.60      
    1.61 -    /// \ref named-templ-param "Named parameter" function for setting PredNodeMap type
    1.62 -
    1.63 -    /// \ref named-templ-param "Named parameter" function for setting PredNodeMap type
    1.64 +    ///\brief \ref named-templ-param "Named parameter"
    1.65 +    ///function for setting PredNodeMap type
    1.66 +    ///
    1.67 +    /// \ref named-templ-param "Named parameter"
    1.68 +    ///function for setting PredNodeMap type
    1.69      ///
    1.70      template<class T>
    1.71      DijkstraWizard<DefPredNodeMapBase<T> > predNodeMap(const T &t) 
    1.72 @@ -899,9 +906,11 @@
    1.73        DefDistMapBase(const Base &b) : Base(b) {}
    1.74      };
    1.75      
    1.76 -    /// \ref named-templ-param "Named parameter" function for setting DistMap type
    1.77 -
    1.78 -    /// \ref named-templ-param "Named parameter" function for setting DistMap type
    1.79 +    ///\brief \ref named-templ-param "Named parameter"
    1.80 +    ///function for setting DistMap type
    1.81 +    ///
    1.82 +    /// \ref named-templ-param "Named parameter"
    1.83 +    ///function for setting DistMap type
    1.84      ///
    1.85      template<class T>
    1.86      DijkstraWizard<DefDistMapBase<T> > distMap(const T &t)