An eulerian cycle is a path in a graph which visits every edge exactly once, and starts and ends at the same node.

1 | ```
hasEulerianCycle(graph)
``` |

`graph` |
a |

A graph will have an euler cycle if and only if every node has same number of edges entering into and going out of it.

`TRUE`

, if graph has an auler cycle. `FALSE`

, otherwise.

Ashis Saha

1 2 3 4 5 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.