[Graphs?] Struggling figuring out the algorithm
Task: create the most city road repair plan with the least steps.
Can only repair up to 2 roads at a time.
If road disconnects any of the places it cannot be repaired.
Input in u3.txt side result on the other.
Can only repair up to 2 roads at a time.
If road disconnects any of the places it cannot be repaired.
Input in u3.txt side result on the other.
