1.1 --- a/src/lemon/concept/path.h	Mon Mar 28 23:34:26 2005 +0000
     1.2 +++ b/src/lemon/concept/path.h	Tue Mar 29 07:35:09 2005 +0000
     1.3 @@ -36,7 +36,7 @@
     1.4      //! A skeleton structure for representing directed paths in a graph.
     1.5      //! \param GR The graph type in which the path is.
     1.6      //!
     1.7 -    //! In a sense, the path can be treated as a graph, for is has \c NodeIt
     1.8 +    //! In a sense, the path can be treated as a graph, for it has \c NodeIt
     1.9      //! and \c EdgeIt with the same usage. These types converts to the \c Node
    1.10      //! and \c Edge of the original graph.
    1.11      template<typename GR>
    1.12 @@ -172,9 +172,9 @@
    1.13         * arbitrary order then you should commit these changes to the graph.
    1.14         *
    1.15         * While the builder is active (after the first modifying
    1.16 -       * operation and until the call of \ref commit())
    1.17 -       * the underlining Path is in a
    1.18 -       * "transitional" state (operations on it have undefined result).
    1.19 +       * operation and until the call of \ref commit()) the
    1.20 +       * underlining Path is in a "transitional" state (operations on
    1.21 +       * it have undefined result).
    1.22         */
    1.23        class Builder {
    1.24        public:
    1.25 @@ -190,7 +190,7 @@
    1.26  
    1.27  	/// Sets the starting node of the path. Edge added to the path
    1.28  	/// afterwards have to be incident to this node.
    1.29 -	/// You \em must start building an empry path with this functions.
    1.30 +	/// You \em must start building an empty path with these functions.
    1.31  	/// (And you \em must \em not use it later).
    1.32  	/// \sa pushFront()
    1.33  	/// \sa pushBack()
    1.34 @@ -215,13 +215,13 @@
    1.35  
    1.36  	///Reserve (front) storage for the builder in advance.
    1.37  
    1.38 -	///If you know an reasonable upper bound of the number of the edges
    1.39 +	///If you know a reasonable upper bound on the number of the edges
    1.40  	///to add to the front of the path,
    1.41  	///using this function you may speed up the building.
    1.42  	void reserveFront(size_t r) {}
    1.43  	///Reserve (back) storage for the builder in advance.
    1.44  
    1.45 -	///If you know an reasonable upper bound of the number of the edges
    1.46 +	///If you know a reasonable upper bound on the number of the edges
    1.47  	///to add to the back of the path,
    1.48  	///using this function you may speed up the building.
    1.49  	void reserveBack(size_t r) {}