summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
raw | bz2 | zip | gz |
help

author | Alpar Juttner <alpar@cs.elte.hu> |

Mon, 23 Feb 2009 11:30:15 +0000 | |

changeset 568 | 3af83b6be1df |

parent 567 | 42d4b889903a |

child 569 | 22f932bbb305 |

Rename euler() to eulerian() (#65)

lemon/euler.h | file | annotate | diff | comparison | revisions |

1.1 --- a/lemon/euler.h Mon Feb 23 11:30:15 2009 +0000 1.2 +++ b/lemon/euler.h Mon Feb 23 11:30:15 2009 +0000 1.3 @@ -228,25 +228,25 @@ 1.4 }; 1.5 1.6 1.7 - ///Checks if the graph is Euler 1.8 + ///Checks if the graph is Eulerian 1.9 1.10 /// \ingroup graph_prop 1.11 - ///Checks if the graph is Euler. It works for both directed and undirected 1.12 + ///Checks if the graph is Eulerian. It works for both directed and undirected 1.13 ///graphs. 1.14 - ///\note By definition, a digraph is called \e Euler if 1.15 + ///\note By definition, a digraph is called \e Eulerian if 1.16 ///and only if it is connected and the number of its incoming and outgoing 1.17 ///arcs are the same for each node. 1.18 - ///Similarly, an undirected graph is called \e Euler if 1.19 + ///Similarly, an undirected graph is called \e Eulerian if 1.20 ///and only if it is connected and the number of incident arcs is even 1.21 - ///for each node. <em>Therefore, there are digraphs which are not Euler, but 1.22 - ///still have an Euler tour</em>. 1.23 + ///for each node. <em>Therefore, there are digraphs which are not Eulerian, 1.24 + ///but still have an Euler tour</em>. 1.25 ///\todo Test required 1.26 template<class Digraph> 1.27 #ifdef DOXYGEN 1.28 bool 1.29 #else 1.30 typename enable_if<UndirectedTagIndicator<Digraph>,bool>::type 1.31 - euler(const Digraph &g) 1.32 + eulerian(const Digraph &g) 1.33 { 1.34 for(typename Digraph::NodeIt n(g);n!=INVALID;++n) 1.35 if(countIncEdges(g,n)%2) return false; 1.36 @@ -255,7 +255,7 @@ 1.37 template<class Digraph> 1.38 typename disable_if<UndirectedTagIndicator<Digraph>,bool>::type 1.39 #endif 1.40 - euler(const Digraph &g) 1.41 + eulerian(const Digraph &g) 1.42 { 1.43 for(typename Digraph::NodeIt n(g);n!=INVALID;++n) 1.44 if(countInArcs(g,n)!=countOutArcs(g,n)) return false;