mirror of
https://github.com/datahub-project/datahub.git
synced 2025-08-21 15:48:05 +00:00
34 lines
773 B
Python
34 lines
773 B
Python
|
import pytest
|
||
|
|
|
||
|
|
from datahub.utilities.topological_sort import topological_sort
|
||
|
|
|
||
|
|
|
||
|
|
def test_topological_sort_valid():
|
||
|
|
nodes = ["a", "b", "c", "d", "e", "f"]
|
||
|
|
edges = [
|
||
|
|
("a", "d"),
|
||
|
|
("f", "b"),
|
||
|
|
("b", "d"),
|
||
|
|
("f", "a"),
|
||
|
|
("d", "c"),
|
||
|
|
]
|
||
|
|
|
||
|
|
# This isn't the only valid topological sort order.
|
||
|
|
expected_order = ["e", "f", "b", "a", "d", "c"]
|
||
|
|
assert list(topological_sort(nodes, edges)) == expected_order
|
||
|
|
|
||
|
|
|
||
|
|
def test_topological_sort_invalid():
|
||
|
|
nodes = ["a", "b", "c", "d", "e", "f"]
|
||
|
|
edges = [
|
||
|
|
("a", "d"),
|
||
|
|
("f", "b"),
|
||
|
|
("b", "d"),
|
||
|
|
("f", "a"),
|
||
|
|
("d", "c"),
|
||
|
|
("c", "f"),
|
||
|
|
]
|
||
|
|
|
||
|
|
with pytest.raises(ValueError, match="cycle"):
|
||
|
|
list(topological_sort(nodes, edges))
|