Added solution for detecting cycles.

root-11 · Feb 27, 2024 · 65ab8b5 · 65ab8b5
1 parent 87e8129
commit 65ab8b5
Showing 1 changed file with 2 additions and 1 deletion.
diff --git a/graph/cycle.py b/graph/cycle.py
@@ -1,4 +1,5 @@
 from .base import BasicGraph
+from .topological_sort import topological_sort
 
 
 def cycle(graph, start, mid, end=None):
@@ -39,7 +40,7 @@ def has_cycles(graph):
         if n1 == n2:  # detect nodes that point to themselves
             return True
     try:
-        _ = list(graph.phase_lines())  # tries to create a DAG.
+        _ = list(topological_sort(graph))  # tries to create a DAG.
         return False
     except AttributeError:
         return True