refactor(graphs): remove redundant TypeVar definitions

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__(

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__(

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]:

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

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: