Expand description
Algorithms related to Eulerian graphs.
Functionsยง
- decomposes_
into_ eulerian_ cycles - Returns true if the graph contains a Eulerian cycle.
- find_
non_ eulerian_ nodes - Compute a vector of nodes that has indegree != outdegree.
- find_
non_ eulerian_ nodes_ with_ differences - Compute a vector of tuples of nodes and outdegree - indegree that has indegree != outdegree.