We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent de0fc7e commit ca0f4e0Copy full SHA for ca0f4e0
yongjun-0903/도넛과 막대 그래프.py
@@ -0,0 +1,36 @@
1
+def donot(node):
2
+ """
3
+ 정점이 같음
4
5
+def bar():
6
7
+ 정점이 다름
8
9
+def eight():
10
11
+ 정점의 개수 2n + 1
12
+ 간선의 개수 2n + 2
13
14
+
15
+from collections import deque
16
+def solution(edges):
17
+ answer = [0] * 4
18
+ g = {}
19
20
+ for edge in edges:
21
+ if edge[0] not in g:
22
+ g[edge[0]] = [edge[1]]
23
+ else:
24
+ g[edge[0]].append(edge[1])
25
+ print(g)
26
+ start_nodes = deque(g[list(g.keys())[0]])
27
+ print(start_nodes)
28
29
+ while start_nodes:
30
+ start_node = start_nodes.popleft()
31
32
+ nodes = 1
33
+ edges = 0
34
35
+ for neibor in g[start_node]:
36
0 commit comments