1.1 --- a/lemon/dfs.h	Mon Dec 19 09:43:13 2005 +0000
     1.2 +++ b/lemon/dfs.h	Mon Dec 19 09:47:10 2005 +0000
     1.3 @@ -559,8 +559,8 @@
     1.4      ///\pre init() must be called and at least one node should be added
     1.5      ///with addSource() before using this function.
     1.6      ///
     1.7 -    ///\param nm must be a bool (or convertible) edge map. The algorithm
     1.8 -    ///will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.
     1.9 +    ///\param em must be a bool (or convertible) edge map. The algorithm
    1.10 +    ///will stop when it reaches an edge \c e with \code em[e]==true \endcode.
    1.11      ///
    1.12      ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c em is an edge map,
    1.13      ///not a node map.
    1.14 @@ -1144,7 +1144,7 @@
    1.15      /// \brief Instantiates a ReachedMap.
    1.16      ///
    1.17      /// This function instantiates a \ref ReachedMap. 
    1.18 -    /// \param G is the graph, to which
    1.19 +    /// \param graph is the graph, to which
    1.20      /// we would like to define the \ref ReachedMap.
    1.21      static ReachedMap *createReachedMap(const Graph &graph) {
    1.22        return new ReachedMap(graph);
    1.23 @@ -1427,8 +1427,8 @@
    1.24      /// \pre init() must be called and at least one node should be added
    1.25      /// with addSource() before using this function.
    1.26      ///
    1.27 -    /// \param nm must be a bool (or convertible) edge map. The algorithm
    1.28 -    /// will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.
    1.29 +    /// \param em must be a bool (or convertible) edge map. The algorithm
    1.30 +    /// will stop when it reaches an edge \c e with \code nm[e]==true \endcode.
    1.31      ///
    1.32      /// \warning Contrary to \ref Dfs and \ref Dijkstra, \c em is an edge map,
    1.33      /// not a node map.

     2.1 --- a/lemon/floyd_warshall.h	Mon Dec 19 09:43:13 2005 +0000
     2.2 +++ b/lemon/floyd_warshall.h	Mon Dec 19 09:47:10 2005 +0000
     2.3 @@ -98,7 +98,7 @@
     2.4      // The type of the length of the edges.
     2.5      typedef typename _LengthMap::Value Value;
     2.6  
     2.7 -    /// \brief Operation traits for belmann-ford algorithm.
     2.8 +    /// \brief Operation traits for floyd-warshall algorithm.
     2.9      ///
    2.10      /// It defines the infinity type on the given Value type
    2.11      /// and the used operation.