1.1 --- a/lemon/kruskal.h	Sun Oct 22 19:45:57 2006 +0000
     1.2 +++ b/lemon/kruskal.h	Tue Oct 24 16:49:41 2006 +0000
     1.3 @@ -59,7 +59,7 @@
     1.4    /// - Any readable Edge map. The values of the map indicate the edge costs.
     1.5    ///
     1.6    /// \retval out Here we also have a choise.
     1.7 -  /// - Is can be a writable \c bool edge map. 
     1.8 +  /// - It can be a writable \c bool edge map. 
     1.9    /// After running the algorithm
    1.10    /// this will contain the found minimum cost spanning tree: the value of an
    1.11    /// edge will be set to \c true if it belongs to the tree, otherwise it will
    1.12 @@ -69,7 +69,7 @@
    1.13    /// The algorithm copies the elements of the found tree into this sequence.
    1.14    /// For example, if we know that the spanning tree of the graph \c g has
    1.15    /// say 53 edges, then
    1.16 -  /// we can put its edges into a STL vector \c tree with a code like this.
    1.17 +  /// we can put its edges into an STL vector \c tree with a code like this.
    1.18    ///\code
    1.19    /// std::vector<Edge> tree(53);
    1.20    /// kruskal(g,cost,tree.begin());
    1.21 @@ -82,7 +82,7 @@
    1.22    ///
    1.23    /// \return The cost of the found tree.
    1.24    ///
    1.25 -  /// \warning If kruskal is run on an
    1.26 +  /// \warning If kruskal runs on an
    1.27    /// \ref lemon::concept::UGraph "undirected graph", be sure that the
    1.28    /// map storing the tree is also undirected
    1.29    /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
    1.30 @@ -391,7 +391,7 @@
    1.31  //   The algorithm copies the elements of the found tree into this sequence.
    1.32  //   For example, if we know that the spanning tree of the graph \c g has
    1.33  //   say 53 edges, then
    1.34 -//   we can put its edges into a STL vector \c tree with a code like this.
    1.35 +//   we can put its edges into an STL vector \c tree with a code like this.
    1.36  //\code
    1.37  //   std::vector<Edge> tree(53);
    1.38  //   kruskal(g,cost,tree.begin());

     2.1 --- a/lemon/min_cost_arborescence.h	Sun Oct 22 19:45:57 2006 +0000
     2.2 +++ b/lemon/min_cost_arborescence.h	Tue Oct 24 16:49:41 2006 +0000
     2.3 @@ -58,7 +58,7 @@
     2.4      ///
     2.5      /// The type of the map that stores which edges are in the arborescence.
     2.6      /// It must meet the \ref concept::WriteMap "WriteMap" concept.
     2.7 -    /// Initially it will be setted to false on each edge. After it
     2.8 +    /// Initially it will be set to false on each edge. After it
     2.9      /// will set all arborescence edges once.
    2.10      typedef typename Graph::template EdgeMap<bool> ArborescenceMap; 
    2.11