COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
03/29/05 09:35:09 (16 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/bfs.h

    r1236 r1270  
    136136  ///a Bfs traits class.
    137137  ///
    138   ///\author Jacint Szabo and Alpar Juttner
     138  ///\author Alpar Juttner
    139139  ///\todo A compare object would be nice.
    140140
     
    349349    ///\ref named-templ-param "Named parameter"
    350350    ///for setting the ProcessedMap type to be Graph::NodeMap<bool>.
    351     ///If you don't set it explicitely, it will be automatically allocated.
     351    ///If you don't set it explicitly, it will be automatically allocated.
    352352    template <class T>
    353353    class DefProcessedMapToBeDefaultMap :
     
    386386    ///Sets the map storing the predecessor edges.
    387387    ///If you don't use this function before calling \ref run(),
    388     ///it will allocate one. The destuctor deallocates this
     388    ///it will allocate one. The destructor deallocates this
    389389    ///automatically allocated map, of course.
    390390    ///\return <tt> (*this) </tt>
     
    403403    ///Sets the map indicating the reached nodes.
    404404    ///If you don't use this function before calling \ref run(),
    405     ///it will allocate one. The destuctor deallocates this
     405    ///it will allocate one. The destructor deallocates this
    406406    ///automatically allocated map, of course.
    407407    ///\return <tt> (*this) </tt>
     
    420420    ///Sets the map indicating the processed nodes.
    421421    ///If you don't use this function before calling \ref run(),
    422     ///it will allocate one. The destuctor deallocates this
     422    ///it will allocate one. The destructor deallocates this
    423423    ///automatically allocated map, of course.
    424424    ///\return <tt> (*this) </tt>
     
    437437//     ///Sets the map storing the predecessor nodes.
    438438//     ///If you don't use this function before calling \ref run(),
    439 //     ///it will allocate one. The destuctor deallocates this
     439//     ///it will allocate one. The destructor deallocates this
    440440//     ///automatically allocated map, of course.
    441441//     ///\return <tt> (*this) </tt>
     
    454454    ///Sets the map storing the distances calculated by the algorithm.
    455455    ///If you don't use this function before calling \ref run(),
    456     ///it will allocate one. The destuctor deallocates this
     456    ///it will allocate one. The destructor deallocates this
    457457    ///automatically allocated map, of course.
    458458    ///\return <tt> (*this) </tt>
     
    659659    ///\pre \ref run() must be called before using this function.
    660660    ///\warning If node \c v in unreachable from the root(s) the return value
    661     ///of this funcion is undefined.
     661    ///of this function is undefined.
    662662    int dist(Node v) const { return (*_dist)[v]; }
    663663
     
    716716
    717717    ///Returns \c true if \c v is reachable from the root.
    718     ///\warning The source nodes are inditated as unreached.
     718    ///\warning The source nodes are indicated as unreached.
    719719    ///\pre Either \ref run() or \ref start()
    720720    ///must be called before using this function.
Note: See TracChangeset for help on using the changeset viewer.