Question 1
A waste collection service needs to plan a route that traverses every street in a suburb exactly once, returning to the depot. The street network has 8 vertices (intersections), 12 edges (streets), and all vertices have even degree except for two vertices which have odd degree. Which statement correctly describes the route planning problem?
Worked answer
🔒 Start free to see full answer