What is an Euler circuit in a graph?
Visits every edge exactly once and returns to start
Visits every vertex exactly once
A path between two specific vertices
The shortest path in a graph