You are a street sweeper. Consider a graph where the the streets are the edges and the intersections are the vertices. You want to drive over each street exactly once without repeating any edges. Would this path be represented by an Euler circuit or a Hamiltonian circuit?
Write
EUL
for Euler circuit or
HAM
for Hamiltonian circuit.
ANSWER: