1.1 --- a/doc/named-param.dox	Thu May 26 13:21:47 2005 +0000
     1.2 +++ b/doc/named-param.dox	Thu May 26 15:33:16 2005 +0000
     1.3 @@ -44,12 +44,12 @@
     1.4  \section traits-classes Traits Classes
     1.5  
     1.6  The procedure above can also be applied when defining classes. In this case the type of the attributes can be changed.
     1.7 -Initially we have to define a class with the default attribute types. This is the se called Traits Class. Later on
     1.8 -the types of these attributes can be changed, as described below. In our software \ref DijkstraDefaultTraits is an example of how a traits class look like.
     1.9 +Initially we have to define a class with the default attribute types. This is the so called Traits Class. Later on
    1.10 +the types of these attributes can be changed, as described below. In our software \ref DijkstraDefaultTraits is an example of how a traits class looks like.
    1.11  
    1.12  \section named-templ-param Named Class Template Parameters
    1.13  
    1.14 -If we would like to change the type of an attribute in a class that was instantiated by using a traits class as a template parameter, and the class contains named parameters, we do not have to reinstantiate the class with new traits class. Instead of that adaptor classes can be used like in the following cases.
    1.15 +If we would like to change the type of an attribute in a class that was instantiated by using a traits class as a template parameter, and the class contains named parameters, we do not have to reinstantiate the class with new traits class. Instead of that, adaptor classes can be used like in the following cases.
    1.16  
    1.17  \code
    1.18  Dijkstra<>::SetPredNodeMap<NullMap<Node,Node> >

     2.1 --- a/lemon/dfs.h	Thu May 26 13:21:47 2005 +0000
     2.2 +++ b/lemon/dfs.h	Thu May 26 15:33:16 2005 +0000
     2.3 @@ -600,8 +600,8 @@
     2.4      ///with addSource() before using this function.
     2.5      ///
     2.6      ///\param nm must be a bool (or convertible) edge map. The algorithm
     2.7 -    ///will stop when it reaches a edge \c v with <tt>nm[v]==true</tt>.
     2.8 -    ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c mn is an edge map,
     2.9 +    ///will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.
    2.10 +    ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c nm is an edge map,
    2.11      ///not a node map.
    2.12      template<class NM>
    2.13        void start(const NM &nm)
    2.14 @@ -663,9 +663,10 @@
    2.15      ///Copies the path to \c t on the DFS tree into \c p
    2.16      
    2.17      ///This function copies the path on the DFS tree to \c t into \c p.
    2.18 -    ///If it \c \t is a source itself or unreachable, then it does not
    2.19 +    ///If \c t is a source itself or unreachable, then it does not
    2.20      ///alter \c p.
    2.21 -    ///\todo Is it the right way to handle unreachable nodes?
    2.22 +    ///\todo Is this the right way to handle unreachable nodes?
    2.23 +    ///
    2.24      ///\return Returns \c true if a path to \c t was actually copied to \c p,
    2.25      ///\c false otherwise.
    2.26      ///\sa DirPath
    2.27 @@ -687,7 +688,7 @@
    2.28  
    2.29      ///Returns the distance of a node from the root(s).
    2.30      ///\pre \ref run() must be called before using this function.
    2.31 -    ///\warning If node \c v in unreachable from the root(s) the return value
    2.32 +    ///\warning If node \c v is unreachable from the root(s) then the return value
    2.33      ///of this funcion is undefined.
    2.34      int dist(Node v) const { return (*_dist)[v]; }
    2.35  
    2.36 @@ -744,8 +745,8 @@
    2.37  
    2.38      ///Checks if a node is reachable from the root.
    2.39  
    2.40 -    ///Returns \c true if \c v is reachable from the root.
    2.41 -    ///\warning The source nodes are inditated as unreached.
    2.42 +    ///Returns \c true if \c v is reachable from the root(s).
    2.43 +    ///\warning The source nodes are inditated as unreachable.
    2.44      ///\pre Either \ref run() or \ref start()
    2.45      ///must be called before using this function.
    2.46      ///
    2.47 @@ -916,7 +917,7 @@
    2.48    /// return the needed class.
    2.49    ///
    2.50    /// It does not have own \ref run method. When its \ref run method is called
    2.51 -  /// it initiates a plain \ref Dfs class, and calls the \ref Dfs::run
    2.52 +  /// it initiates a plain \ref Dfs object, and calls the \ref Dfs::run
    2.53    /// method of it.
    2.54    template<class TR>
    2.55    class DfsWizard : public TR