Euler Paths
An Euler path for a graph is a path that uses
every edge of the graph precisely once.
To draw an Euler path: Start at a vertex.
Traverse each edge exactly once.
If any vertex has odd degree, it must be either the start
or end of the Euler path, if there is one.
No Euler path can have more than 1 start and 1 end.