A graph is said to be Eulerian if it contains a closed trail that includes every:
Show Hint
A connected graph is Eulerian if and only if every vertex in the graph has an even degree. This is a very fast way to check if a graph contains an Eulerian circuit.