Index: lemon/euler.h
===================================================================
--- lemon/euler.h (revision 520)
+++ lemon/euler.h (revision 521)
@@ -229,16 +229,16 @@
- ///Checks if the graph is Euler
+ ///Checks if the graph is Eulerian
/// \ingroup graph_prop
- ///Checks if the graph is Euler. It works for both directed and undirected
+ ///Checks if the graph is Eulerian. It works for both directed and undirected
///graphs.
- ///\note By definition, a digraph is called \e Euler if
+ ///\note By definition, a digraph is called \e Eulerian if
///and only if it is connected and the number of its incoming and outgoing
///arcs are the same for each node.
- ///Similarly, an undirected graph is called \e Euler if
+ ///Similarly, an undirected graph is called \e Eulerian if
///and only if it is connected and the number of incident arcs is even
- ///for each node. Therefore, there are digraphs which are not Euler, but
- ///still have an Euler tour.
+ ///for each node. Therefore, there are digraphs which are not Eulerian,
+ ///but still have an Euler tour.
///\todo Test required
template
@@ -247,5 +247,5 @@
#else
typename enable_if,bool>::type
- euler(const Digraph &g)
+ eulerian(const Digraph &g)
{
for(typename Digraph::NodeIt n(g);n!=INVALID;++n)
@@ -256,5 +256,5 @@
typename disable_if,bool>::type
#endif
- euler(const Digraph &g)
+ eulerian(const Digraph &g)
{
for(typename Digraph::NodeIt n(g);n!=INVALID;++n)