1.1 --- a/lemon/dijkstra.h	Mon Jul 04 16:18:11 2005 +0000
     1.2 +++ b/lemon/dijkstra.h	Mon Jul 04 16:27:54 2005 +0000
     1.3 @@ -108,9 +108,13 @@
     1.4      ///Instantiates a ProcessedMap.
     1.5   
     1.6      ///This function instantiates a \ref ProcessedMap. 
     1.7 -    ///\param G is the graph, to which
     1.8 +    ///\param g is the graph, to which
     1.9      ///we would like to define the \ref ProcessedMap
    1.10 +#ifdef DOXYGEN
    1.11 +    static ProcessedMap *createProcessedMap(const GR &g)
    1.12 +#else
    1.13      static ProcessedMap *createProcessedMap(const GR &)
    1.14 +#endif
    1.15      {
    1.16        return new ProcessedMap();
    1.17      }
    1.18 @@ -663,7 +667,7 @@
    1.19      ///Copies the shortest path to \c t into \c p
    1.20      
    1.21      ///This function copies the shortest path to \c t into \c p.
    1.22 -    ///If it \c \t is a source itself or unreachable, then it does not
    1.23 +    ///If it \c t is a source itself or unreachable, then it does not
    1.24      ///alter \c p.
    1.25      ///\todo Is it the right way to handle unreachable nodes?
    1.26      ///\return Returns \c true if a path to \c t was actually copied to \c p,
    1.27 @@ -788,9 +792,13 @@
    1.28      ///Instantiates a PredMap.
    1.29   
    1.30      ///This function instantiates a \ref PredMap. 
    1.31 -    ///\param G is the graph, to which we would like to define the PredMap.
    1.32 +    ///\param g is the graph, to which we would like to define the PredMap.
    1.33      ///\todo The graph alone may be insufficient for the initialization
    1.34 +#ifdef DOXYGEN
    1.35 +    static PredMap *createPredMap(const GR &g) 
    1.36 +#else
    1.37      static PredMap *createPredMap(const GR &) 
    1.38 +#endif
    1.39      {
    1.40        return new PredMap();
    1.41      }
    1.42 @@ -806,9 +814,13 @@
    1.43      ///Instantiates a ProcessedMap.
    1.44   
    1.45      ///This function instantiates a \ref ProcessedMap. 
    1.46 -    ///\param G is the graph, to which
    1.47 +    ///\param g is the graph, to which
    1.48      ///we would like to define the \ref ProcessedMap
    1.49 +#ifdef DOXYGEN
    1.50 +    static ProcessedMap *createProcessedMap(const GR &g)
    1.51 +#else
    1.52      static ProcessedMap *createProcessedMap(const GR &)
    1.53 +#endif
    1.54      {
    1.55        return new ProcessedMap();
    1.56      }
    1.57 @@ -821,8 +833,12 @@
    1.58      ///Instantiates a DistMap.
    1.59   
    1.60      ///This function instantiates a \ref DistMap. 
    1.61 -    ///\param G is the graph, to which we would like to define the \ref DistMap
    1.62 +    ///\param g is the graph, to which we would like to define the \ref DistMap
    1.63 +#ifdef DOXYGEN
    1.64 +    static DistMap *createDistMap(const GR &g)
    1.65 +#else
    1.66      static DistMap *createDistMap(const GR &)
    1.67 +#endif
    1.68      {
    1.69        return new DistMap();
    1.70      }