mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

[mypy] Fix mypy error (#4524)

Browse Source
This commit is contained in:
strambake 2021-07-06 12:38:33 +05:30 committed by GitHub
parent 95862303a6
commit 4412eafaac
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
graphs/scc_kosaraju.py
View File

@ -1,25 +1,28 @@
from typing import List
def dfs(u):
global g, r, scc, component, visit, stack
global graph, reversedGraph, scc, component, visit, stack
if visit[u]:
return
visit[u] = True
for v in g[u]:
for v in graph[u]:
dfs(v)
stack.append(u)
def dfs2(u):
global g, r, scc, component, visit, stack
global graph, reversedGraph, scc, component, visit, stack
if visit[u]:
return
visit[u] = True
component.append(u)
for v in r[u]:
for v in reversedGraph[u]:
dfs2(v)
def kosaraju():
global g, r, scc, component, visit, stack
global graph, reversedGraph, scc, component, visit, stack
for i in range(n):
dfs(i)
visit = [False] * n
@ -36,16 +39,16 @@ if __name__ == "__main__":
# n - no of nodes, m - no of edges
n, m = list(map(int, input().strip().split()))
g = [[] for i in range(n)] # graph
r = [[] for i in range(n)] # reversed graph
graph: List[List[int]] = [[] for i in range(n)] # graph
reversedGraph: List[List[int]] = [[] for i in range(n)] # reversed graph
# input graph data (edges)
for i in range(m):
u, v = list(map(int, input().strip().split()))
g[u].append(v)
r[v].append(u)
graph[u].append(v)
reversedGraph[v].append(u)
stack = []
visit = [False] * n
scc = []
component = []
stack: List[int] = []
visit: List[bool] = [False] * n
scc: List[int] = []
component: List[int] = []
print(kosaraju())