Changeset 1970:bd88ea06ab69 in lemon0.x for lemon
 Timestamp:
 02/20/06 07:38:18 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2554
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/euler.h
r1956 r1970 35 35 /// \ingroup topology 36 36 ///This iterator converts to the \c Edge type of the graph and using 37 ///operator ++ it provides an Euler tour of the graph (if there exists). 37 ///operator ++ it provides an Euler tour of a \e directed 38 ///graph (if there exists). 38 39 /// 39 40 ///For example 40 41 ///if the given graph if Euler (i.e it has only one nontrivial component 41 42 ///and the indegree is equal to the outdegree for all nodes), 42 ///the following code will print the edge IDs according to an 43 ///the following code will put the edges of \c g 44 ///to the vector \c et according to an 43 45 ///Euler tour of \c g. 44 46 ///\code 45 /// for(EulerIt<ListGraph> e(g),e!=INVALID;++e) {46 /// std::cout << g.id(e) << std::eol;47 /// }47 /// std::vector<ListGraph::Edge> et; 48 /// for(EulerIt<ListGraph> e(g),e!=INVALID;++e) 49 /// et.push_back(e); 48 50 ///\endcode 49 51 ///If \c g is not Euler then the resulted tour will not be full or closed. 52 ///\sa UEulerIt 50 53 ///\todo Test required 51 54 template<class Graph> … … 119 122 120 123 /// \ingroup topology 121 ///This iterator converts to the \c Edge type of the graph and using 122 ///operator ++ it provides an Euler tour of the graph (if there exists). 124 ///This iterator converts to the \c Edge (or \cUEdge) 125 ///type of the graph and using 126 ///operator ++ it provides an Euler tour of an \undirected 127 ///graph (if there exists). 123 128 /// 124 129 ///For example … … 137 142 /// 138 143 ///If \c g is not Euler then the resulted tour will not be full or closed. 144 ///\sa EulerIt 139 145 ///\todo Test required 140 146 template<class Graph>
Note: See TracChangeset
for help on using the changeset viewer.