equal
deleted
inserted
replaced
22 #include<lemon/core.h> |
22 #include<lemon/core.h> |
23 #include<lemon/adaptors.h> |
23 #include<lemon/adaptors.h> |
24 #include<lemon/connectivity.h> |
24 #include<lemon/connectivity.h> |
25 #include <list> |
25 #include <list> |
26 |
26 |
27 /// \ingroup graph_prop |
27 /// \ingroup graph_properties |
28 /// \file |
28 /// \file |
29 /// \brief Euler tour |
29 /// \brief Euler tour |
30 /// |
30 /// |
31 ///This file provides an Euler tour iterator and ways to check |
31 ///This file provides an Euler tour iterator and ways to check |
32 ///if a digraph is euler. |
32 ///if a digraph is euler. |
34 |
34 |
35 namespace lemon { |
35 namespace lemon { |
36 |
36 |
37 ///Euler iterator for digraphs. |
37 ///Euler iterator for digraphs. |
38 |
38 |
39 /// \ingroup graph_prop |
39 /// \ingroup graph_properties |
40 ///This iterator converts to the \c Arc type of the digraph and using |
40 ///This iterator converts to the \c Arc type of the digraph and using |
41 ///operator ++, it provides an Euler tour of a \e directed |
41 ///operator ++, it provides an Euler tour of a \e directed |
42 ///graph (if there exists). |
42 ///graph (if there exists). |
43 /// |
43 /// |
44 ///For example |
44 ///For example |
121 } |
121 } |
122 }; |
122 }; |
123 |
123 |
124 ///Euler iterator for graphs. |
124 ///Euler iterator for graphs. |
125 |
125 |
126 /// \ingroup graph_prop |
126 /// \ingroup graph_properties |
127 ///This iterator converts to the \c Arc (or \c Edge) |
127 ///This iterator converts to the \c Arc (or \c Edge) |
128 ///type of the digraph and using |
128 ///type of the digraph and using |
129 ///operator ++, it provides an Euler tour of an undirected |
129 ///operator ++, it provides an Euler tour of an undirected |
130 ///digraph (if there exists). |
130 ///digraph (if there exists). |
131 /// |
131 /// |
226 }; |
226 }; |
227 |
227 |
228 |
228 |
229 ///Checks if the graph is Eulerian |
229 ///Checks if the graph is Eulerian |
230 |
230 |
231 /// \ingroup graph_prop |
231 /// \ingroup graph_properties |
232 ///Checks if the graph is Eulerian. It works for both directed and undirected |
232 ///Checks if the graph is Eulerian. It works for both directed and undirected |
233 ///graphs. |
233 ///graphs. |
234 ///\note By definition, a digraph is called \e Eulerian if |
234 ///\note By definition, a digraph is called \e Eulerian if |
235 ///and only if it is connected and the number of its incoming and outgoing |
235 ///and only if it is connected and the number of its incoming and outgoing |
236 ///arcs are the same for each node. |
236 ///arcs are the same for each node. |