DM.GT.2.a: Determine whether a graph has an Euler circuit or path, and determine the circuit or path, if it exists.