Euler classification macro

[jpmmcneill]

Eulerian paths and Eulerian circuits

[jpmmcneill]

From wikipedia:

In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices). Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex.