Apply suggestions from code review

Author: cclauss

graphs/check_cycle.py

@@ -7,11 +7,9 @@ def check_cycle(graph: dict) -> bool:
     """
     Returns True if graph is cyclic else False
 
-    >>> graph1 = {0:[], 1:[0, 3], 2:[0, 4], 3:[5], 4:[5], 5:[]}
-    >>> check_cycle(graph1)
+    >>> check_cycle(graph={0:[], 1:[0, 3], 2:[0, 4], 3:[5], 4:[5], 5:[]})
     False
-    >>> graph2 = {0:[1, 2], 1:[2], 2:[0, 3], 3:[3]}
-    >>> check_cycle(graph2)
+    >>> check_cycle(graph={0:[1, 2], 1:[2], 2:[0, 3], 3:[3]})
     True
     """
     # Keep track of visited nodes