LEMON/LEMON-main Changeset - r521:3af83b6be1df

Repositories » LEMON » LEMON-main

Changeset - r521:3af83b6be1df

« 520:42d4b8

522:22f932 »

r521:3af83b6be1df

Mon, 23 Feb 2009 12:30:15

[Not Reviewed]

0 comments (0 inline)

alpar (Alpar Juttner)
alpar@cs.elte.hu

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

0 1 0

default

1 file changed with 8 insertions and 8 deletions:

lemon/euler.h

↑ Collapse diff ↑

lemon/euler.h

Show inline comments

@@ -230,14 +230,14 @@
-		  ///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. <em>Therefore, there are digraphs which are not Euler, but
 		  ///still have an Euler tour</em>.
 		  ///for each node. <em>Therefore, there are digraphs which are not Eulerian,
 		  ///but still have an Euler tour</em>.
 		  ///\todo Test required
@@ -248,3 +248,3 @@
 		  typename enable_if<UndirectedTagIndicator<Digraph>,bool>::type
-		  euler(const Digraph &g)
+		  eulerian(const Digraph &g)
+		  {
@@ -257,3 +257,3 @@
 		#endif
-		  euler(const Digraph &g)
+		  eulerian(const Digraph &g)
+		  {

0 comments (0 inline)

RhodeCode