Topics
Eulerian circuit
An Eulerian circuit is a special kind circuit that traverses every edge exactly once.
In other words, a walk is Eulerian if it starts and ends at the same vertex, uses every edge, but does not reuse any edge.
Eulerian circuit ✓
Not an Eulerian circuit ✗, because DB not traversed.
Not an Eulerian circuit ✗, because DA traversed twice.
Not an Eulerian circuit ✗, does not start and end at the same vertex (not a circuit)
Eulerian circuit
An Eulerian circuit is a special kind circuit that traverses every edge exactly once.
In other words, a walk is Eulerian if it starts and ends at the same vertex, uses every edge, but does not reuse any edge.
Eulerian circuit ✓
Not an Eulerian circuit ✗, because DB not traversed.
Not an Eulerian circuit ✗, because DA traversed twice.
Not an Eulerian circuit ✗, does not start and end at the same vertex (not a circuit)