Skip to content

Commit da71184

Browse files
mhihasanmhihasan
authored
Fix mypy errors at mst_kruskal (TheAlgorithms#4581)
1 parent a5bcf0f commit da71184

2 files changed

Lines changed: 9 additions & 10 deletions

File tree

‎graphs/minimum_spanning_tree_kruskal.py‎

Lines changed: 7 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,14 @@
1-
from typing import List, Tuple
2-
3-
4-
def kruskal(num_nodes: int, num_edges: int, edges: List[Tuple[int, int, int]]) -> int:
1+
def kruskal(
2+
num_nodes: int, edges: list[tuple[int, int, int]]
3+
) -> list[tuple[int, int, int]]:
54
"""
6-
>>> kruskal(4, 3, [(0, 1, 3), (1, 2, 5), (2, 3, 1)])
5+
>>> kruskal(4, [(0, 1, 3), (1, 2, 5), (2, 3, 1)])
76
[(2, 3, 1), (0, 1, 3), (1, 2, 5)]
87
9-
>>> kruskal(4, 5, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2)])
8+
>>> kruskal(4, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2)])
109
[(2, 3, 1), (0, 2, 1), (0, 1, 3)]
1110
12-
>>> kruskal(4, 6, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2),
11+
>>> kruskal(4, [(0, 1, 3), (1, 2, 5), (2, 3, 1), (0, 2, 1), (0, 3, 2),
1312
... (2, 1, 1)])
1413
[(2, 3, 1), (0, 2, 1), (2, 1, 1)]
1514
"""
@@ -44,4 +43,4 @@ def find_parent(i):
4443
node1, node2, cost = [int(x) for x in input().strip().split()]
4544
edges.append((node1, node2, cost))
4645

47-
kruskal(num_nodes, num_edges, edges)
46+
kruskal(num_nodes, edges)

‎graphs/tests/test_min_spanning_tree_kruskal.py‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33

44
def test_kruskal_successful_result():
5-
num_nodes, num_edges = 9, 14
5+
num_nodes = 9
66
edges = [
77
[0, 1, 4],
88
[0, 7, 8],
@@ -20,7 +20,7 @@ def test_kruskal_successful_result():
2020
[1, 7, 11],
2121
]
2222

23-
result = kruskal(num_nodes, num_edges, edges)
23+
result = kruskal(num_nodes, edges)
2424

2525
expected = [
2626
[7, 6, 1],

0 commit comments

Comments
 (0)