Garbage trucks have to visit every edge (street segment) once, not every vertex (intersection) once, correct? Can you use Eulerian Paths?

http://en.m.wikipedia.org/wiki/Eulerian_path

Or is the process to make a non-Eulerian graph Eulerian NP?