def test_adjacency_list():
v_1 = AdjacencyListGraphNode('v_1', 1)
v_2 = AdjacencyListGraphNode('v_2', 2)
g = Graph(v_1, v_2, implementation='adjacency_list')
v_3 = AdjacencyListGraphNode('v_3', 3)
g.add_vertex(v_2)
g.add_vertex(v_3)
g.add_edge('v_1', 'v_2')
g.add_edge('v_2', 'v_3')
g.add_edge('v_3', 'v_1')
assert g.is_adjacent('v_1', 'v_2') is True
assert g.is_adjacent('v_2', 'v_3') is True
assert g.is_adjacent('v_3', 'v_1') is True
assert g.is_adjacent('v_2', 'v_1') is False
assert g.is_adjacent('v_3', 'v_2') is False
assert g.is_adjacent('v_1', 'v_3') is False
neighbors = g.neighbors('v_1')
assert neighbors == [v_2]
v = AdjacencyListGraphNode('v', 4)
g.add_vertex(v)
g.add_edge('v_1', 'v')
g.add_edge('v_2', 'v')
g.add_edge('v_3', 'v')
assert g.is_adjacent('v_1', 'v') is True
assert g.is_adjacent('v_2', 'v') is True
assert g.is_adjacent('v_3', 'v') is True
g.remove_edge('v_1', 'v')
assert g.is_adjacent('v_1', 'v') is False
g.remove_vertex('v')
assert g.is_adjacent('v_2', 'v') is False
assert g.is_adjacent('v_3', 'v') is False
def test_adjacency_list():
v_1 = AdjacencyListGraphNode('v_1', 1)
v_2 = AdjacencyListGraphNode('v_2', 2)
g = Graph(v_1, v_2, implementation='adjacency_list')
v_3 = AdjacencyListGraphNode('v_3', 3)
g.add_vertex(v_2)
g.add_vertex(v_3)
g.add_edge('v_1', 'v_2')
g.add_edge('v_2', 'v_3')
g.add_edge('v_3', 'v_1')
assert g.is_adjacent('v_1', 'v_2') is True
assert g.is_adjacent('v_2', 'v_3') is True
assert g.is_adjacent('v_3', 'v_1') is True
assert g.is_adjacent('v_2', 'v_1') is False
assert g.is_adjacent('v_3', 'v_2') is False
assert g.is_adjacent('v_1', 'v_3') is False
neighbors = g.neighbors('v_1')
assert neighbors == [v_2]
v = AdjacencyListGraphNode('v', 4)
g.add_vertex(v)
g.add_edge('v_1', 'v', 0)
g.add_edge('v_2', 'v', 0)
g.add_edge('v_3', 'v', 0)
assert g.is_adjacent('v_1', 'v') is True
assert g.is_adjacent('v_2', 'v') is True
assert g.is_adjacent('v_3', 'v') is True
e1 = g.get_edge('v_1', 'v')
e2 = g.get_edge('v_2', 'v')
e3 = g.get_edge('v_3', 'v')
assert (e1.source.name, e1.target.name) == ('v_1', 'v')
assert (e2.source.name, e2.target.name) == ('v_2', 'v')
assert (e3.source.name, e3.target.name) == ('v_3', 'v')
g.remove_edge('v_1', 'v')
assert g.is_adjacent('v_1', 'v') is False
g.remove_vertex('v')
assert g.is_adjacent('v_2', 'v') is False
assert g.is_adjacent('v_3', 'v') is False
assert raises(ValueError, lambda: g.add_edge('u', 'v'))
assert raises(ValueError, lambda: g.add_edge('v', 'x'))
def test_AdjacencyListGraphNode():
g_1 = AdjacencyListGraphNode('g_1', 1)
g_2 = AdjacencyListGraphNode('g_2', 2)
g = AdjacencyListGraphNode('g', 0, adjacency_list=[g_1, g_2])
g.add_adjacent_node('g_3', 3)
assert g.g_1.name == 'g_1'
assert g.g_2.name == 'g_2'
assert g.g_3.name == 'g_3'
g.remove_adjacent_node('g_3')
assert hasattr(g, 'g_3') is False
assert raises(ValueError, lambda: g.remove_adjacent_node('g_3'))
g.add_adjacent_node('g_1', 4)
assert g.g_1.data == 4
assert str(g) == "('g', 0)"
def test_GraphEdge():
g_1 = AdjacencyListGraphNode('g_1', 1)
g_2 = AdjacencyListGraphNode('g_2', 2)
e = GraphEdge(g_1, g_2, value=2)
assert str(e) == "('g_1', 'g_2')"