Changeset 1803:ee8dd6872645 in lemon0.x for lemon
 Timestamp:
 11/16/05 14:15:33 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2346
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/euler.h
r1769 r1803 31 31 /// \ingroup topology 32 32 ///This iterator converts to the \c Edge type of the graph and using 33 /// the ++ operatorit provides an Euler tour of the graph (if there exists).33 ///operator ++ it provides an Euler tour of the graph (if there exists). 34 34 /// 35 35 ///For example 36 36 ///if the given graph if Euler (i.e it has only one nontrivial component 37 37 ///and the indegree is equal to the outdegree for all nodes), 38 ///the thefollowing code will print the edge IDs according to an38 ///the following code will print the edge IDs according to an 39 39 ///Euler tour of \c g. 40 40 ///\code … … 65 65 ///\param _g A directed graph. 66 66 ///\param start The starting point of the tour. If it is not given 67 /// th otour will start from the first node.67 /// the tour will start from the first node. 68 68 EulerIt(const Graph &_g,typename Graph::Node start=INVALID) 69 69 : g(_g), nedge(g) … … 101 101 ///Postfix incrementation 102 102 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. 104 106 Edge operator++(int) 105 107 {
Note: See TracChangeset
for help on using the changeset viewer.