diff --git a/graphs/finding_bridges.py b/graphs/finding_bridges.py
index a877a9748..3813c4ebb 100644
--- a/graphs/finding_bridges.py
+++ b/graphs/finding_bridges.py
@@ -93,8 +93,14 @@ def compute_bridges(graph: dict[int, list[int]]) -> list[tuple[int, int]]:
                 # This edge is a back edge and cannot be a bridge
                 low[at] = min(low[at], low[to])
 
-    bridges = []
+    bridges: list[tuple[int, int]] = []
     for i in range(n):
         if not visited[i]:
             dfs(i, -1, bridges, id)
     return bridges
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()
diff --git a/graphs/random_graph_generator.py b/graphs/random_graph_generator.py
index d7d5de8a3..15ccee5b3 100644
--- a/graphs/random_graph_generator.py
+++ b/graphs/random_graph_generator.py
@@ -26,7 +26,7 @@ def random_graph(
     >>> random_graph(4, 0.5, True)
     {0: [1], 1: [2, 3], 2: [3], 3: []}
     """
-    graph = {i: [] for i in range(vertices_number)}
+    graph: dict = {i: [] for i in range(vertices_number)}
 
     # if probability is greater or equal than 1, then generate a complete graph
     if probability >= 1:
diff --git a/mypy.ini b/mypy.ini
index 16ca60c4d..429c6804d 100644
--- a/mypy.ini
+++ b/mypy.ini
@@ -2,4 +2,4 @@
 ignore_missing_imports = True
 install_types = True
 non_interactive = True
-exclude = (graphs/breadth_first_search.py|graphs/breadth_first_search_2.py|graphs/check_cycle.py|graphs/finding_bridges.py|graphs/greedy_min_vertex_cover.py|graphs/random_graph_generator.py|matrix_operation.py|other/least_recently_used.py|other/lfu_cache.py|other/lru_cache.py|searches/simulated_annealing.py|searches/ternary_search.py)
+exclude = (graphs/breadth_first_search.py|graphs/breadth_first_search_2.py|graphs/check_cycle.py|graphs/greedy_min_vertex_cover.py|matrix_operation.py|other/least_recently_used.py|other/lfu_cache.py|other/lru_cache.py|searches/simulated_annealing.py|searches/ternary_search.py)