diff --git a/graphs/graph_adjacency_list.py b/graphs/graph_adjacency_list.py
index d9fe1ed6636b..25001e8f9ca5 100644
--- a/graphs/graph_adjacency_list.py
+++ b/graphs/graph_adjacency_list.py
@@ -21,12 +21,9 @@
 import random
 import unittest
 from pprint import pformat
-from typing import TypeVar
 
 import pytest
 
-T = TypeVar("T")
-
 
 class GraphAdjacencyList[T]:
     def __init__(
diff --git a/graphs/graph_adjacency_matrix.py b/graphs/graph_adjacency_matrix.py
index d8dd4424e3cc..1118e75be455 100644
--- a/graphs/graph_adjacency_matrix.py
+++ b/graphs/graph_adjacency_matrix.py
@@ -21,12 +21,9 @@
 import random
 import unittest
 from pprint import pformat
-from typing import TypeVar
 
 import pytest
 
-T = TypeVar("T")
-
 
 class GraphAdjacencyMatrix[T]:
     def __init__(
diff --git a/graphs/graph_list.py b/graphs/graph_list.py
index 6b63590bf55a..6960526527e0 100644
--- a/graphs/graph_list.py
+++ b/graphs/graph_list.py
@@ -6,9 +6,6 @@
 from __future__ import annotations
 
 from pprint import pformat
-from typing import TypeVar
-
-T = TypeVar("T")
 
 
 class GraphAdjacencyList[T]:
diff --git a/graphs/minimum_spanning_tree_kruskal2.py b/graphs/minimum_spanning_tree_kruskal2.py
index 1f6d7255683b..013fbf07e637 100644
--- a/graphs/minimum_spanning_tree_kruskal2.py
+++ b/graphs/minimum_spanning_tree_kruskal2.py
@@ -1,9 +1,5 @@
 from __future__ import annotations
 
-from typing import TypeVar
-
-T = TypeVar("T")
-
 
 class DisjointSetTreeNode[T]:
     # Disjoint Set Node to store the parent and rank
diff --git a/graphs/minimum_spanning_tree_prims2.py b/graphs/minimum_spanning_tree_prims2.py
index d22111289a48..458791284699 100644
--- a/graphs/minimum_spanning_tree_prims2.py
+++ b/graphs/minimum_spanning_tree_prims2.py
@@ -10,9 +10,6 @@
 from __future__ import annotations
 
 from sys import maxsize
-from typing import TypeVar
-
-T = TypeVar("T")
 
 
 def get_parent_position(position: int) -> int: