-
Notifications
You must be signed in to change notification settings - Fork 1
/
Eventual_Safe_States.py
49 lines (37 loc) · 1.12 KB
/
Eventual_Safe_States.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
from typing import List
class Solution:
def eventualSafeNodes(self, V: int, adj: List[List[int]]) -> List[int]:
def is_safe(node):
if node in safe:
return True
if node in visited:
return False
visited.add(node)
for neighbor in adj[node]:
if not is_safe(neighbor):
return False
visited.remove(node)
safe.add(node)
return True
safe = set()
visited = set()
for node in range(V):
is_safe(node)
return sorted(list(safe))
#{
# Driver Code Starts
#Initial Template for Python 3
if __name__=="__main__":
T = int(input())
for t in range(T):
V, E = map(int, input().strip().split())
adj = [[] for i in range(V)]
for i in range(E):
u, v = map(int, input().strip().split())
adj[u].append(v)
obj = Solution()
ans = obj.eventualSafeNodes(V, adj)
for nodes in ans:
print(nodes, end = ' ')
print()
# } Driver Code Ends