equal
deleted
inserted
replaced
14 * |
14 * |
15 */ |
15 */ |
16 #include<lemon/invalid.h> |
16 #include<lemon/invalid.h> |
17 #include <list> |
17 #include <list> |
18 |
18 |
19 /// \ingroup gutils |
19 /// \ingroup topology |
20 /// \file |
20 /// \file |
21 /// \brief Euler tour |
21 /// \brief Euler tour |
22 /// |
22 /// |
23 ///This file provides an Euler tour iterator and ways to check |
23 ///This file provides an Euler tour iterator and ways to check |
24 ///if a graph is euler. |
24 ///if a graph is euler. |
26 |
26 |
27 namespace lemon { |
27 namespace lemon { |
28 |
28 |
29 ///Euler iterator in directed graphs. |
29 ///Euler iterator in directed graphs. |
30 |
30 |
31 /// \ingroup gutils |
31 /// \ingroup topology |
32 ///This iterator converts to the \c Edge type of the graph and using |
32 ///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 ///the ++ operator it provides an Euler tour of the graph (if there exists). |
34 /// |
34 /// |
35 ///For example |
35 ///For example |
36 ///if the given graph if Euler (i.e it has only one nontrivial component |
36 ///if the given graph if Euler (i.e it has only one nontrivial component |
112 ///Checks if the graph is Euler |
112 ///Checks if the graph is Euler |
113 |
113 |
114 /// \ingroup gutils |
114 /// \ingroup gutils |
115 ///Checks if the graph is Euler. It works for both directed and |
115 ///Checks if the graph is Euler. It works for both directed and |
116 ///undirected graphs. |
116 ///undirected graphs. |
117 ///\todo What to do with the isolated points? |
|
118 ///\todo Test required |
117 ///\todo Test required |
119 template<class Graph> |
118 template<class Graph> |
120 #ifdef DOXYGEN |
119 #ifdef DOXYGEN |
121 bool |
120 bool |
122 #else |
121 #else |