Fix mypy errors at mst_kruskal
diff --git a/graphs/minimum_spanning_tree_kruskal.py b/graphs/minimum_spanning_tree_kruskal.py
index a51f970341f7..f21a87a7d534 100644
--- a/graphs/minimum_spanning_tree_kruskal.py
+++ b/graphs/minimum_spanning_tree_kruskal.py
@@ -1,15 +1,14 @@
-from typing import List, Tuple
-
-
-def kruskal(num_nodes: int, num_edges: int, edges: List[Tuple[int, int, int]]) -> int:
+def kruskal(
+    num_nodes: int, edges: list[tuple[int, int, int]]
+) -> list[tuple[int, int, int]]:
     """
-    >>> kruskal(4, 3, [(0, 1, 3), (1, 2, 5), (2, 3, 1)])
+    >>> kruskal(4, [(0, 1, 3), (1, 2, 5), (2, 3, 1)])
     [(2, 3, 1), (0, 1, 3), (1, 2, 5)]
 
-    >>> kruskal(4, 5, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2)])
+    >>> kruskal(4, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2)])
     [(2, 3, 1), (0, 2, 1), (0, 1, 3)]
 
-    >>> kruskal(4, 6, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2),
+    >>> kruskal(4, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2),
     ... (2, 1, 1)])
     [(2, 3, 1), (0, 2, 1), (2, 1, 1)]
     """
@@ -44,4 +43,4 @@ def find_parent(i):
         node1, node2, cost = [int(x) for x in input().strip().split()]
         edges.append((node1, node2, cost))
 
-    kruskal(num_nodes, num_edges, edges)
+    kruskal(num_nodes, edges)
diff --git a/graphs/tests/test_min_spanning_tree_kruskal.py b/graphs/tests/test_min_spanning_tree_kruskal.py
index 3a527aef384f..d6df242ec6d1 100644
--- a/graphs/tests/test_min_spanning_tree_kruskal.py
+++ b/graphs/tests/test_min_spanning_tree_kruskal.py
@@ -2,7 +2,7 @@
 
 
 def test_kruskal_successful_result():
-    num_nodes, num_edges = 9, 14
+    num_nodes = 9
     edges = [
         [0, 1, 4],
         [0, 7, 8],
@@ -20,7 +20,7 @@ def test_kruskal_successful_result():
         [1, 7, 11],
     ]
 
-    result = kruskal(num_nodes, num_edges, edges)
+    result = kruskal(num_nodes, edges)
 
     expected = [
         [7, 6, 1],

### **Describe your change:**

Fix mypy errors at mst_kruskal

### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file.  To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
