# HG changeset patch
# User deba
# Date 1134985630 0
# Node ID dcefd1d1377f862c8169fd01f28ed83a4d0ebd98
# Parent  1788205e36af6cc51419574d3ac45c0baa46d954
Doc fix

diff -r 1788205e36af -r dcefd1d1377f lemon/dfs.h
--- a/lemon/dfs.h	Mon Dec 19 09:43:13 2005 +0000
+++ b/lemon/dfs.h	Mon Dec 19 09:47:10 2005 +0000
@@ -559,8 +559,8 @@
     ///\pre init() must be called and at least one node should be added
     ///with addSource() before using this function.
     ///
-    ///\param nm must be a bool (or convertible) edge map. The algorithm
-    ///will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.
+    ///\param em must be a bool (or convertible) edge map. The algorithm
+    ///will stop when it reaches an edge \c e with \code em[e]==true \endcode.
     ///
     ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c em is an edge map,
     ///not a node map.
@@ -1144,7 +1144,7 @@
     /// \brief Instantiates a ReachedMap.
     ///
     /// This function instantiates a \ref ReachedMap. 
-    /// \param G is the graph, to which
+    /// \param graph is the graph, to which
     /// we would like to define the \ref ReachedMap.
     static ReachedMap *createReachedMap(const Graph &graph) {
       return new ReachedMap(graph);
@@ -1427,8 +1427,8 @@
     /// \pre init() must be called and at least one node should be added
     /// with addSource() before using this function.
     ///
-    /// \param nm must be a bool (or convertible) edge map. The algorithm
-    /// will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.
+    /// \param em must be a bool (or convertible) edge map. The algorithm
+    /// will stop when it reaches an edge \c e with \code nm[e]==true \endcode.
     ///
     /// \warning Contrary to \ref Dfs and \ref Dijkstra, \c em is an edge map,
     /// not a node map.
diff -r 1788205e36af -r dcefd1d1377f lemon/floyd_warshall.h
--- a/lemon/floyd_warshall.h	Mon Dec 19 09:43:13 2005 +0000
+++ b/lemon/floyd_warshall.h	Mon Dec 19 09:47:10 2005 +0000
@@ -98,7 +98,7 @@
     // The type of the length of the edges.
     typedef typename _LengthMap::Value Value;
 
-    /// \brief Operation traits for belmann-ford algorithm.
+    /// \brief Operation traits for floyd-warshall algorithm.
     ///
     /// It defines the infinity type on the given Value type
     /// and the used operation.