I have n roads and m cities. Each road has its own length. I need to visit all roads and find the shortest path for that. A graph is connected. I can start from any city.
