Changeset 2259:da142c310d02 in lemon-0.x

Timestamp:

10/24/06 18:49:41 (17 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3015

Message:

Spellcheck

Location:

lemon

Files:

• kruskal.h (modified) (4 diffs)
• min_cost_arborescence.h (modified) (1 diff)

lemon/kruskal.h

@@ -60 +60 @@
   ///
   /// \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 +70 @@
   /// 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);
@@ -83 +83 @@
   /// \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 +392 @@
 //   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);

lemon/min_cost_arborescence.h

@@ -59 +59 @@
     /// 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;