Skip to content

Commit 4412eaf

Browse files
authored
[mypy] Fix mypy error (TheAlgorithms#4524)
1 parent 9586230 commit 4412eaf

File tree

1 file changed

+16
-13
lines changed

1 file changed

+16
-13
lines changed

graphs/scc_kosaraju.py

+16-13
Original file line numberDiff line numberDiff line change
@@ -1,25 +1,28 @@
1+
from typing import List
2+
3+
14
def dfs(u):
2-
global g, r, scc, component, visit, stack
5+
global graph, reversedGraph, scc, component, visit, stack
36
if visit[u]:
47
return
58
visit[u] = True
6-
for v in g[u]:
9+
for v in graph[u]:
710
dfs(v)
811
stack.append(u)
912

1013

1114
def dfs2(u):
12-
global g, r, scc, component, visit, stack
15+
global graph, reversedGraph, scc, component, visit, stack
1316
if visit[u]:
1417
return
1518
visit[u] = True
1619
component.append(u)
17-
for v in r[u]:
20+
for v in reversedGraph[u]:
1821
dfs2(v)
1922

2023

2124
def kosaraju():
22-
global g, r, scc, component, visit, stack
25+
global graph, reversedGraph, scc, component, visit, stack
2326
for i in range(n):
2427
dfs(i)
2528
visit = [False] * n
@@ -36,16 +39,16 @@ def kosaraju():
3639
# n - no of nodes, m - no of edges
3740
n, m = list(map(int, input().strip().split()))
3841

39-
g = [[] for i in range(n)] # graph
40-
r = [[] for i in range(n)] # reversed graph
42+
graph: List[List[int]] = [[] for i in range(n)] # graph
43+
reversedGraph: List[List[int]] = [[] for i in range(n)] # reversed graph
4144
# input graph data (edges)
4245
for i in range(m):
4346
u, v = list(map(int, input().strip().split()))
44-
g[u].append(v)
45-
r[v].append(u)
47+
graph[u].append(v)
48+
reversedGraph[v].append(u)
4649

47-
stack = []
48-
visit = [False] * n
49-
scc = []
50-
component = []
50+
stack: List[int] = []
51+
visit: List[bool] = [False] * n
52+
scc: List[int] = []
53+
component: List[int] = []
5154
print(kosaraju())

0 commit comments

Comments
 (0)