def test_neighbours():
g = Graph()
for i in range(10):
g.add_vertex(i)
for v in g.vertices():
for w in range(v):
assert len(g.neighbours(v)) == g.degree(v)
assert len(g.neighbours(v, outgoing = False)) == g.degree(v, outgoing = False)
assert len(g.neighbours(v, ingoing = False)) == g.degree(v, ingoing = False)
assert g.degree(v) == g.degree(v, outgoing = False) + g.degree(v, ingoing = False)
g.add_edge(v,w,v-w)
assert (w,v-w) in g.neighbours(v)
assert (v,v-w) in g.neighbours(w)
assert (w,v-w) in g.neighbours(v, ingoing = False)
assert (v,v-w) in g.neighbours(w, outgoing = False)
assert (w,v-w) not in g.neighbours(v, outgoing = False)
assert (v,v-w) not in g.neighbours(w, ingoing = False)
def test_graph():
g = Graph("graph")
g.add_edge(1, 2)
g.add_edge(2, 1)
g.add_edge(1, 3, label="test")
g.add_edge(3, 2, color="blue")
g.add_edge(3, 4)
g.add_edge(4, 2)
g.add_edge(1, 2)
g.add_edge(4, 1)
print(g.get_source())
g.view()
g.del_edge(1, 2)
g.del_edge(10, 30)
g.del_edge(1, 3, label="test_")
g.del_edge(1, 3, label="test")
print(g.get_source())
g.view()