def fully_connected_graph(nodes):
g = SimpleGraph()
for node in nodes:
g.add_node(node)
for other_node in nodes:
if other_node is not node:
g.add_edge(node, other_node)
return g
def fully_connected_graph(nodes):
g = SimpleGraph()
for node in nodes:
g.add_node(node)
for other_node in nodes:
if other_node is not node:
g.add_edge(node, other_node)
return g
def test_has_node():
"""edge added, new node added"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
assert g.has_node('b')
def test_has_node():
"""edge added, new node added"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
assert g.has_node('b')
def test_del_edge():
"""other edges preserved when one deleted"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
g.del_edge('a', 'c')
assert g.neighbors('a') == {'b': 0}
def test_del_error():
"""error raised when non-existant value deleted"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
with pytest.raises(KeyError):
g.del_node('p')
def test_edge_error():
"""delete non-existant edge"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
with pytest.raises(KeyError):
g.del_edge('a', 'z')
def test_adjacent_error():
"""error raised when nodes non-existant"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
with pytest.raises(KeyError):
g.adjacent('l', 'm')
def test_adjacent_error():
"""error raised when nodes non-existant"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
with pytest.raises(KeyError):
g.adjacent('l', 'm')
def test_del_edge():
"""other edges preserved when one deleted"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
g.del_edge('a', 'c')
assert g.neighbors('a') == {'b': 0}
def test_edge_error():
"""delete non-existant edge"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
with pytest.raises(KeyError):
g.del_edge('a', 'z')
def test_edges():
"""edges prints correct edges as tuples"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
assert ('a', 'c') in g.edges()
assert ('a', 'b') in g.edges()
def test_del_error():
"""error raised when non-existant value deleted"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
with pytest.raises(KeyError):
g.del_node('p')
def test_edges():
"""edges prints correct edges as tuples"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
assert ('a', 'c') in g.edges()
assert ('a', 'b') in g.edges()
def test_adjacent():
"""adjacent correctly identify edges, new edge add node"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'd')
g.add_edge('a', 'f')
assert 'f' in g.nodes()
assert g.adjacent('a', 'd')
assert not g.adjacent('a', 'b')
def test_add_nodes():
"""nodes are added"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
assert 'a' in g.nodes()
assert 'b' in g.nodes()
assert 'c' in g.nodes()
def test_add_edge():
"""edge added, new node added"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
g.add_edge('q', 'a')
assert g.has_node('q')
assert g.neighbors('q') == {'a': 0}
def test_del_nodes():
"""nodes are deleted"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
g.del_node('a')
assert 'a' not in g.nodes()
assert g.has_node('a') is False
def test_del_nodes():
"""nodes are deleted"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
g.del_node('a')
assert 'a' not in g.nodes()
assert g.has_node('a') is False
def test_adjacent():
"""adjacent correctly identify edges, new edge add node"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'd')
g.add_edge('a', 'f')
assert 'f' in g.nodes()
assert g.adjacent('a', 'd')
assert not g.adjacent('a', 'b')
def test_add_nodes():
"""nodes are added"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
assert 'a' in g.nodes()
assert 'b' in g.nodes()
assert 'c' in g.nodes()
def test_add_edge():
"""edge added, new node added"""
g = SimpleGraph()
g.add_node('a')
g.add_node('b')
g.add_node('c')
g.add_edge('a', 'c')
g.add_edge('a', 'b')
g.add_edge('q', 'a')
assert g.has_node('q')
assert g.neighbors('q') == {'a': 0}
def test_one_depth():
g = SimpleGraph()
g.add_node('a')
assert g.depth_first_traversal('a') == ['a']
def test_one_depth():
g = SimpleGraph()
g.add_node('a')
assert g.depth_first_traversal('a') == ['a']