Model the following street map with a graph and design an efficient way of traveling through all the streets so a minimal number of streets are traveled more than once.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.