# HG changeset patch
# User alpar
# Date 1161708581 0
# Node ID da142c310d022f0309a4d2d6a0b97aac2dfc0372
# Parent  741995f3dbc4edfa01406d0c4ff64ffd954ca7f8
Spellcheck

diff -r 741995f3dbc4 -r da142c310d02 lemon/kruskal.h
--- a/lemon/kruskal.h	Sun Oct 22 19:45:57 2006 +0000
+++ b/lemon/kruskal.h	Tue Oct 24 16:49:41 2006 +0000
@@ -59,7 +59,7 @@
   /// - Any readable Edge map. The values of the map indicate the edge costs.
   ///
   /// \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
   /// edge will be set to \c true if it belongs to the tree, otherwise it will
@@ -69,7 +69,7 @@
   /// The algorithm copies the elements of the found tree into this sequence.
   /// 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<Edge> tree(53);
   /// kruskal(g,cost,tree.begin());
@@ -82,7 +82,7 @@
   ///
   /// \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
   /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
@@ -391,7 +391,7 @@
 //   The algorithm copies the elements of the found tree into this sequence.
 //   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<Edge> tree(53);
 //   kruskal(g,cost,tree.begin());
diff -r 741995f3dbc4 -r da142c310d02 lemon/min_cost_arborescence.h
--- a/lemon/min_cost_arborescence.h	Sun Oct 22 19:45:57 2006 +0000
+++ b/lemon/min_cost_arborescence.h	Tue Oct 24 16:49:41 2006 +0000
@@ -58,7 +58,7 @@
     ///
     /// 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<bool> ArborescenceMap;