Changeset 568:3af83b6be1df in lemon for lemon
 Timestamp:
 02/23/09 12:30:15 (15 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/euler.h
r567 r568 229 229 230 230 231 ///Checks if the graph is Euler 231 ///Checks if the graph is Eulerian 232 232 233 233 /// \ingroup graph_prop 234 ///Checks if the graph is Euler . It works for both directed and undirected234 ///Checks if the graph is Eulerian. It works for both directed and undirected 235 235 ///graphs. 236 ///\note By definition, a digraph is called \e Euler if236 ///\note By definition, a digraph is called \e Eulerian if 237 237 ///and only if it is connected and the number of its incoming and outgoing 238 238 ///arcs are the same for each node. 239 ///Similarly, an undirected graph is called \e Euler if239 ///Similarly, an undirected graph is called \e Eulerian if 240 240 ///and only if it is connected and the number of incident arcs is even 241 ///for each node. <em>Therefore, there are digraphs which are not Euler , but242 /// still have an Euler tour</em>.241 ///for each node. <em>Therefore, there are digraphs which are not Eulerian, 242 ///but still have an Euler tour</em>. 243 243 ///\todo Test required 244 244 template<class Digraph> … … 247 247 #else 248 248 typename enable_if<UndirectedTagIndicator<Digraph>,bool>::type 249 euler (const Digraph &g)249 eulerian(const Digraph &g) 250 250 { 251 251 for(typename Digraph::NodeIt n(g);n!=INVALID;++n) … … 256 256 typename disable_if<UndirectedTagIndicator<Digraph>,bool>::type 257 257 #endif 258 euler (const Digraph &g)258 eulerian(const Digraph &g) 259 259 { 260 260 for(typename Digraph::NodeIt n(g);n!=INVALID;++n)
Note: See TracChangeset
for help on using the changeset viewer.