equal
deleted
inserted
replaced
34 |
34 |
35 namespace lemon { |
35 namespace lemon { |
36 |
36 |
37 ///Euler tour iterator for digraphs. |
37 ///Euler tour iterator for digraphs. |
38 |
38 |
39 /// \ingroup graph_prop |
39 /// \ingroup graph_properties |
40 ///This iterator provides an Euler tour (Eulerian circuit) of a \e directed |
40 ///This iterator provides an Euler tour (Eulerian circuit) of a \e directed |
41 ///graph (if there exists) and it converts to the \c Arc type of the digraph. |
41 ///graph (if there exists) and it converts to the \c Arc type of the digraph. |
42 /// |
42 /// |
43 ///For example, if the given digraph has an Euler tour (i.e it has only one |
43 ///For example, if the given digraph has an Euler tour (i.e it has only one |
44 ///non-trivial component and the in-degree is equal to the out-degree |
44 ///non-trivial component and the in-degree is equal to the out-degree |