COIN-OR::LEMON - Graph Library

Changeset 1803:ee8dd6872645 in lemon-0.x for lemon/euler.h


Ignore:
Timestamp:
11/16/05 14:15:33 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2346
Message:

Better doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/euler.h

    r1769 r1803  
    3131  /// \ingroup topology
    3232  ///This iterator converts to the \c Edge type of the graph and using
    33   ///the ++ operator it provides an Euler tour of the graph (if there exists).
     33  ///operator ++ it provides an Euler tour of the graph (if there exists).
    3434  ///
    3535  ///For example
    3636  ///if the given graph if Euler (i.e it has only one nontrivial component
    3737  ///and the in-degree is equal to the out-degree for all nodes),
    38   ///the the following code will print the edge IDs according to an
     38  ///the following code will print the edge IDs according to an
    3939  ///Euler tour of \c g.
    4040  ///\code
     
    6565    ///\param _g A directed graph.
    6666    ///\param start The starting point of the tour. If it is not given
    67     ///       tho tour will start from the first node.
     67    ///       the tour will start from the first node.
    6868    EulerIt(const Graph &_g,typename Graph::Node start=INVALID)
    6969      : g(_g), nedge(g)
     
    101101    ///Postfix incrementation
    102102   
    103     ///\warning This gives back an Edge, not an EulerIt!
     103    ///\warning This incrementation
     104    ///returns an \c Edge, not an \ref EulerIt, as one may
     105    ///expect.
    104106    Edge operator++(int)
    105107    {
Note: See TracChangeset for help on using the changeset viewer.