Changeset 1270:806451fd084b in lemon-0.x for src/lemon/concept

Timestamp:

03/29/05 09:35:09 (19 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

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

Message:

bugfixes in doc

File:

• src/lemon/concept/path.h (modified) (5 diffs)

src/lemon/concept/path.h

@@ -37 +37 @@
     //! \param GR The graph type in which the path is.
     //!
-    //! In a sense, the path can be treated as a graph, for is has \c NodeIt
+    //! In a sense, the path can be treated as a graph, for it has \c NodeIt
     //! and \c EdgeIt with the same usage. These types converts to the \c Node
     //! and \c Edge of the original graph.
@@ -173 +173 @@
        *
        * While the builder is active (after the first modifying
-       * operation and until the call of \ref commit())
-       * the underlining Path is in a
-       * "transitional" state (operations on it have undefined result).
+       * operation and until the call of \ref commit()) the
+       * underlining Path is in a "transitional" state (operations on
+       * it have undefined result).
        */
       class Builder {
@@ -191 +191 @@
         /// Sets the starting node of the path. Edge added to the path
         /// afterwards have to be incident to this node.
-        /// You \em must start building an empry path with this functions.
+        /// You \em must start building an empty path with these functions.
         /// (And you \em must \em not use it later).
         /// \sa pushFront()
@@ -216 +216 @@
         ///Reserve (front) storage for the builder in advance.
 
-        ///If you know an reasonable upper bound of the number of the edges
+        ///If you know a reasonable upper bound on the number of the edges
         ///to add to the front of the path,
         ///using this function you may speed up the building.
@@ -222 +222 @@
         ///Reserve (back) storage for the builder in advance.
 
-        ///If you know an reasonable upper bound of the number of the edges
+        ///If you know a reasonable upper bound on the number of the edges
         ///to add to the back of the path,
         ///using this function you may speed up the building.