Index: lemon/kruskal.h
===================================================================
--- lemon/kruskal.h (revision 2206)
+++ lemon/kruskal.h (revision 2259)
@@ -60,5 +60,5 @@
///
/// \retval out Here we also have a choise.
- /// - Is can be a writable \c bool edge map.
+ /// - It can be a writable \c bool edge map.
/// After running the algorithm
/// this will contain the found minimum cost spanning tree: the value of an
@@ -70,5 +70,5 @@
/// For example, if we know that the spanning tree of the graph \c g has
/// say 53 edges, then
- /// we can put its edges into a STL vector \c tree with a code like this.
+ /// we can put its edges into an STL vector \c tree with a code like this.
///\code
/// std::vector tree(53);
@@ -83,5 +83,5 @@
/// \return The cost of the found tree.
///
- /// \warning If kruskal is run on an
+ /// \warning If kruskal runs on an
/// \ref lemon::concept::UGraph "undirected graph", be sure that the
/// map storing the tree is also undirected
@@ -392,5 +392,5 @@
// For example, if we know that the spanning tree of the graph \c g has
// say 53 edges, then
-// we can put its edges into a STL vector \c tree with a code like this.
+// we can put its edges into an STL vector \c tree with a code like this.
//\code
// std::vector tree(53);
Index: lemon/min_cost_arborescence.h
===================================================================
--- lemon/min_cost_arborescence.h (revision 2151)
+++ lemon/min_cost_arborescence.h (revision 2259)
@@ -59,5 +59,5 @@
/// The type of the map that stores which edges are in the arborescence.
/// It must meet the \ref concept::WriteMap "WriteMap" concept.
- /// Initially it will be setted to false on each edge. After it
+ /// Initially it will be set to false on each edge. After it
/// will set all arborescence edges once.
typedef typename Graph::template EdgeMap ArborescenceMap;