Method for checking whether an eulerian cycle exists.
An eulerian cycle is a path in a graph which visits every edge exactly once, and starts and ends at the same node.
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.
1 2 3 4 5