summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

lemon/euler.h

changeset 695 | 4ff8041e9c2e |

parent 639 | 2ebfdb89ec66 |

child 956 | 141f9c0db4a3 |

child 1081 | f1398882a928 |

1.1 --- a/lemon/euler.h Wed May 06 14:37:44 2009 +0200 1.2 +++ b/lemon/euler.h Wed May 06 14:44:05 2009 +0200 1.3 @@ -244,10 +244,10 @@ 1.4 }; 1.5 1.6 1.7 - ///Check if the given graph is \e Eulerian 1.8 + ///Check if the given graph is Eulerian 1.9 1.10 /// \ingroup graph_properties 1.11 - ///This function checks if the given graph is \e Eulerian. 1.12 + ///This function checks if the given graph is Eulerian. 1.13 ///It works for both directed and undirected graphs. 1.14 /// 1.15 ///By definition, a digraph is called \e Eulerian if