mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
47 lines
1005 B
Python
47 lines
1005 B
Python
from collections import defaultdict
|
|
|
|
from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst
|
|
|
|
|
|
def test_prim_successful_result():
|
|
num_nodes, num_edges = 9, 14 # noqa: F841
|
|
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],
|
|
]
|
|
|
|
adjancency = defaultdict(list)
|
|
for node1, node2, cost in edges:
|
|
adjancency[node1].append([node2, cost])
|
|
adjancency[node2].append([node1, cost])
|
|
|
|
result = mst(adjancency)
|
|
|
|
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],
|
|
]
|
|
|
|
for answer in expected:
|
|
edge = tuple(answer[:2])
|
|
reverse = tuple(edge[::-1])
|
|
assert edge in result or reverse in result
|