cycle
1234567891011121314151617181920212223242526
def dfs(node,parent):
visited.add(node)
for neighbor in graph[node]:
if neighbor not in visited :
if dfs(neighbor, node):
return True
elif neighbor in visited and neighbor!=parent:
return True
return False
graph = {
'A': ['B', 'C', 'D'],
'B': ['A', 'E'],
'C': ['A', 'D', 'E'],
'D': ['A', 'C'],
'E': ['B', 'C']
}
visited=set()
for node in graph:
if node not in visited:
if dfs(node, None): # If cycle is detected
print("Cycle Detected")
break
else:
print("No Cycle Detected")
Python
INFO