revert: Replace broken doctests

Author: CaedenPH

graphs/graph_list.py

@@ -18,7 +18,7 @@ class GraphAdjacencyList(Generic[T]):
 
     Directed graph example:
     >>> d_graph = GraphAdjacencyList()
-    >>> d_graph
+    >>> print(d_graph)
     {}
     >>> d_graph.add_edge(0, 1)
     {0: [1], 1: []}
@@ -28,7 +28,7 @@ class GraphAdjacencyList(Generic[T]):
     {0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
     >>> d_graph
     {0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
-    >>> repr(d_graph)
+    >>> print(repr(d_graph))
     {0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
 
     Undirected graph example:
@@ -47,15 +47,15 @@ class GraphAdjacencyList(Generic[T]):
      5: [1, 4],
      6: [2],
      7: [2]}
-    >>> u_graph
+    >>> print(u_graph)
     {0: [1, 2],
      1: [0, 2, 4, 5],
      2: [1, 0, 6, 7],
      4: [1, 5],
      5: [1, 4],
      6: [2],
      7: [2]}
-    >>> repr(u_graph)
+    >>> print(repr(u_graph))
     {0: [1, 2],
      1: [0, 2, 4, 5],
      2: [1, 0, 6, 7],
@@ -148,3 +148,7 @@ def add_edge(
 
     def __repr__(self) -> str:
         return pformat(self.adj_list)
+
+import doctest
+
+doctest.testmod()

graphs/minimum_spanning_tree_boruvka.py

@@ -154,7 +154,7 @@ def boruvka_mst(graph):
         >>> g = Graph.build([0, 1, 2, 3], [[0, 1, 1], [0, 2, 1],[2, 3, 1]])
         >>> g.distinct_weight()
         >>> bg = Graph.boruvka_mst(g)
-        >>> bg
+        >>> print(bg)
         1 -> 0 == 1
         2 -> 0 == 2
         0 -> 1 == 1