프로그래머스 - 전력망을 둘로 나누기 (L2)

 1def solution(n, wires):
 2    tower = [[] for _ in range(n)]
 3    answer = 100
 4    for wire in wires:
 5        wire[0] -= 1
 6        wire[1] -= 1
 7        tower[wire[0]].append(wire[1])
 8        tower[wire[1]].append(wire[0])
 9    
10    def traverse(visited, start):
11        visited[start] = True
12        for i in tower[start]:
13            if not visited[i]:
14                traverse(visited, i)
15    for wire in wires:
16        tower[wire[0]].remove(wire[1])
17        tower[wire[1]].remove(wire[0])
18
19        visited = [False]*n
20        a = 0
21        traverse(visited, wire[0])
22        for i in range(n):
23            if visited[i]:
24                a += 1
25
26        visited = [False]*n
27        b = 0
28        traverse(visited, wire[1])
29        for i in range(n):
30            if visited[i]:
31                b += 1
32        answer = min(answer, abs(a-b))
33        tower[wire[0]].append(wire[1])
34        tower[wire[1]].append(wire[0])
35    return answer