algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 10:31:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Travis CI: Add pytest --doctest-modules graphs (#1018)

Browse Source
This commit is contained in:
cclauss
2019-07-17 06:07:25 +02:00
committed by GitHub
parent 267b5eff40
commit 7cdda931fd
9 changed files with 145 additions and 132 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
graphs/scc_kosaraju.py
View File

@ -1,19 +1,5 @@
from __future__ import print_function
# n - no of nodes, m - no of edges
n, m = list(map(int,input().split()))
g = [[] for i in range(n)] #graph
r = [[] for i in range(n)] #reversed graph
# input graph data (edges)
for i in range(m):
u, v = list(map(int,input().split()))
g[u].append(v)
r[v].append(u)
stack = []
visit = [False]*n
scc = []
component = []
def dfs(u):
global g, r, scc, component, visit, stack
@ -43,4 +29,21 @@ def kosaraju():
scc.append(component)
return scc
print(kosaraju())
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
# 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)
stack = []
visit = [False]*n
scc = []
component = []
print(kosaraju())