Method for checking whether an eulerian cycle exists.
An eulerian path is a path in a graph which visits every edge exactly once.
1  hasEulerianPath(graph, start = NULL)

graph 
a 
start 

If start
is NULL
, this function returns whether there exists any eulerian path in graph
. If start
is not NULL
, the function determines if there exists an eulerian path starting from start
.
TRUE
, if there is an eulerian path. FALSE
, otherwise.
Ashis Saha
1 2 3 4 5 6 
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
Please suggest features or report bugs with the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.