mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
37 lines
667 B
Python
37 lines
667 B
Python
from graphs.minimum_spanning_tree_kruskal import kruskal
|
|
|
|
|
|
def test_kruskal_successful_result():
|
|
num_nodes = 9
|
|
edges = [
|
|
[0, 1, 4],
|
|
[0, 7, 8],
|
|
[1, 2, 8],
|
|
[7, 8, 7],
|
|
[7, 6, 1],
|
|
[2, 8, 2],
|
|
[8, 6, 6],
|
|
[2, 3, 7],
|
|
[2, 5, 4],
|
|
[6, 5, 2],
|
|
[3, 5, 14],
|
|
[3, 4, 9],
|
|
[5, 4, 10],
|
|
[1, 7, 11],
|
|
]
|
|
|
|
result = kruskal(num_nodes, edges)
|
|
|
|
expected = [
|
|
[7, 6, 1],
|
|
[2, 8, 2],
|
|
[6, 5, 2],
|
|
[0, 1, 4],
|
|
[2, 5, 4],
|
|
[2, 3, 7],
|
|
[0, 7, 8],
|
|
[3, 4, 9],
|
|
]
|
|
|
|
assert sorted(expected) == sorted(result)
|