COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
03/29/05 09:35:09 (15 years ago)
Author:
jacint
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1698
Message:

bugfixes in doc

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/concept/path.h

    r1228 r1270  
    3737    //! \param GR The graph type in which the path is.
    3838    //!
    39     //! In a sense, the path can be treated as a graph, for is has \c NodeIt
     39    //! In a sense, the path can be treated as a graph, for it has \c NodeIt
    4040    //! and \c EdgeIt with the same usage. These types converts to the \c Node
    4141    //! and \c Edge of the original graph.
     
    173173       *
    174174       * While the builder is active (after the first modifying
    175        * operation and until the call of \ref commit())
    176        * the underlining Path is in a
    177        * "transitional" state (operations on it have undefined result).
     175       * operation and until the call of \ref commit()) the
     176       * underlining Path is in a "transitional" state (operations on
     177       * it have undefined result).
    178178       */
    179179      class Builder {
     
    191191        /// Sets the starting node of the path. Edge added to the path
    192192        /// afterwards have to be incident to this node.
    193         /// You \em must start building an empry path with this functions.
     193        /// You \em must start building an empty path with these functions.
    194194        /// (And you \em must \em not use it later).
    195195        /// \sa pushFront()
     
    216216        ///Reserve (front) storage for the builder in advance.
    217217
    218         ///If you know an reasonable upper bound of the number of the edges
     218        ///If you know a reasonable upper bound on the number of the edges
    219219        ///to add to the front of the path,
    220220        ///using this function you may speed up the building.
     
    222222        ///Reserve (back) storage for the builder in advance.
    223223
    224         ///If you know an reasonable upper bound of the number of the edges
     224        ///If you know a reasonable upper bound on the number of the edges
    225225        ///to add to the back of the path,
    226226        ///using this function you may speed up the building.
Note: See TracChangeset for help on using the changeset viewer.