def test_transitive_closure():
edges = graphs.graph({
"a": {},
"b": {"c", "d"},
"c": set(),
"d": {"e"},
"e": set()
})
assert graphs.transitive_closure(edges) == {
"a": set(),
"b": {"c", "d", "e"},
"c": set(),
"d": {"e"},
"e": set(),
}
def test_toposort():
edges = graphs.graph({'a': set(['b', 'c']), 'b': ('c',)})
assert graphs.toposort(edges) == ['a', 'b', 'c']
def test_reversedict():
edges = graphs.graph({'a': set(['b', 'c'])})
r_edges = graphs.reverse_edges(edges)
assert r_edges == {'b': ('a',), 'c': ('a',)}
def test_add_edges():
edges = graphs.graph({'a': set(['b', 'c'])})
graphs.add_edges(edges, [('a', 'd'), ('b', 'c')])
assert edges == {'a': set(['b', 'c', 'd']), 'b': set(['c'])}
def test_toposort():
edges = graphs.graph({'a': {'b', 'c'}, 'b': ('c', )})
assert graphs.toposort(edges) == ['a', 'b', 'c']
def test_reversedict():
edges = graphs.graph({'a': {'b', 'c'}})
r_edges = graphs.reverse_edges(edges)
assert r_edges == {'b': ('a', ), 'c': ('a', )}
def test_add_edges():
edges = graphs.graph({'a': {'b', 'c'}})
graphs.add_edges(edges, [('a', 'd'), ('b', 'c')])
assert edges == {'a': {'b', 'c', 'd'}, 'b': {'c'}}
def test_add_edges():
edges = graphs.graph({'a': set(['b', 'c'])})
graphs.add_edges(edges, [('a', 'd'), ('b', 'c')])
assert edges == {'a': set(['b', 'c', 'd']), 'b': set(['c'])}
def test_toposort():
edges = graphs.graph({"a": {"b", "c"}, "b": {"c"}, "c": set()})
assert graphs.toposort(edges) == ["a", "b", "c"]
def test_add_edges():
edges = graphs.graph({"a": {"b", "c"}})
graphs.add_edges(edges, [("a", "d"), ("b", "c")])
assert edges == {"a": {"b", "c", "d"}, "b": {"c"}}
def test_reversedict():
edges = graphs.graph({"a": {"b", "c"}, "b": set(), "c": set()})
r_edges = graphs.reverse_edges(edges)
assert r_edges == {"a": set(), "b": {"a"}, "c": {"a"}}
def test_toposort():
edges = graphs.graph({'a': {'b', 'c'}, 'b': {'c'}, 'c': set()})
assert graphs.toposort(edges) == ['a', 'b', 'c']
def test_reversedict():
edges = graphs.graph({'a': {'b', 'c'}, 'b': set(), 'c': set()})
r_edges = graphs.reverse_edges(edges)
assert r_edges == {'a': set(), 'b': {'a'}, 'c': {'a'}}
def test_add_edges():
edges = graphs.graph({'a': {'b', 'c'}})
graphs.add_edges(edges, [('a', 'd'), ('b', 'c')])
assert edges == {'a': {'b', 'c', 'd'}, 'b': {'c'}}
def test_transitive_closure():
edges = graphs.graph(
{'a': {}, 'b': {'c', 'd'}, 'c': set(), 'd': {'e', }, 'e': set()})
assert graphs.transitive_closure(edges) == {
'a': set(), 'b': {'c', 'd', 'e'}, 'c': set(), 'd': {'e'}, 'e': set()}
