Fixed doctests

Author: dbring

graphs/deep_clone_graph.py

@@ -16,16 +16,36 @@ def __init__(self, value: int = 0, neighbors: list | None = None) -> None:
         self.value = value
         self.neighbors = neighbors or []
 
+    def __repr__(self):
+        return f"Node({self.value}, {self.neighbors})"
+
 
 def clone_graph(node: Node | None) -> Node | None:
     """
     This function returns a clone of a connected undirected graph.
-    >>> clone_graph(Node(1))
-    Node(1)
-    >>> clone_graph(Node(1, [Node(2)]))
-    Node(1, [Node(2)])
-    >>> clone_graph(None)
-    None
+    >>> node1 = Node(1)
+    >>> node2 = Node(2)
+    >>> node3 = Node(3)
+    >>> node4 = Node(4)
+    >>> node1.neighbors = [node2, node4]
+    >>> node2.neighbors = [node1, node3]
+    >>> node3.neighbors = [node2, node4]
+    >>> node4.neighbors = [node1, node3]
+    >>> clone1 = clone_graph(node1)
+    >>> clone1.value
+    1
+    >>> clone2 = clone1.neighbors[0]
+    >>> clone2.value
+    2
+    >>> clone4 = clone1.neighbors[1]
+    >>> clone4.value
+    4
+    >>> clone3 = clone2.neighbors[1]
+    >>> clone3.value
+    3
+    >>> clone = clone_graph(None)
+    >>> clone is None
+    True
     """
     if not node:
         return None