lemon/euler.h
changeset 695 4ff8041e9c2e
parent 639 2ebfdb89ec66
child 956 141f9c0db4a3
child 1081 f1398882a928
equal deleted inserted replaced
6:79fb63356af8 7:619fb75f39d9
   242       return e;
   242       return e;
   243     }
   243     }
   244   };
   244   };
   245 
   245 
   246 
   246 
   247   ///Check if the given graph is \e Eulerian
   247   ///Check if the given graph is Eulerian
   248 
   248 
   249   /// \ingroup graph_properties
   249   /// \ingroup graph_properties
   250   ///This function checks if the given graph is \e Eulerian.
   250   ///This function checks if the given graph is Eulerian.
   251   ///It works for both directed and undirected graphs.
   251   ///It works for both directed and undirected graphs.
   252   ///
   252   ///
   253   ///By definition, a digraph is called \e Eulerian if
   253   ///By definition, a digraph is called \e Eulerian if
   254   ///and only if it is connected and the number of incoming and outgoing
   254   ///and only if it is connected and the number of incoming and outgoing
   255   ///arcs are the same for each node.
   255   ///arcs are the same for each node.