An eulerian path is a path in a graph which visits every edge exactly once.
NULL, this function returns whether there exists any eulerian path in
start is not
NULL, the function determines if there exists an eulerian path starting from
TRUE, if there is an eulerian path.
1 2 3 4 5 6
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.