def test_constructor(self):
graph = Graph(iter([
(1, 2),
(2, 3, 'a'),
(1, 3),
(3, 4),
]))
self.assertEqual(graph.number_of_nodes(), 4)
self.assertEqual(graph.number_of_edges(), 4)
try:
graph.edge_by_node(1,2)
graph.edge_by_node(2,3)
graph.edge_by_node(1,3)
graph.edge_by_node(3,4)
except GraphError:
self.fail("Incorrect graph")
self.assertEqual(graph.edge_data(graph.edge_by_node(2, 3)), 'a')
self.assertRaises(GraphError, Graph, [(1,2,3,4)])
def davaj_trať(id_relace):
'''
zahájí běh programu
'''
from altgraph.Graph import Graph
graf = Graph()
cesty = davaj_cesty_z_relace(id_relace)
# vložím cesty do grafu
for cesta in cesty:
graf.add_edge(cesta.body_v_cestě[0], cesta.body_v_cestě[-1], {
'id': cesta.id_cesty,
'pořadí': cesta.pořadí_cesty
})
print('graf má {} vrcholů a {} hran'.format(graf.number_of_nodes(),
graf.number_of_edges()))
# projdu všechny vrcholy a vyberu ty, které mají pouze jednu hranu
jednohrané_vrcholy = []
for bod in graf.node_list():
if graf.all_degree(bod) == 1:
# print("vrchol {} vstupuje {} a vystupuje {} hran, celkem {}".format(bod, graf.inc_degree(bod), graf.out_degree(bod), graf.all_degree(bod)))
jednohrané_vrcholy.append(bod)
# jednohrané vrcholy musí být právě dva
if len(jednohrané_vrcholy) != 2:
raise ValueError(
'Tož ale graf musí být právě jeden počátek a právě jeden konec')
# když má graf právě jeden začátek a právě jeden konec, možeme srovnat hrany, otočit je do jednoho směru
else:
print('jednohrané vrcholy', jednohrané_vrcholy)
# tu práci obsatrá rekurzivně tato funkce, která graf pozmění
seřadím_hrany_v_grafu(graf, jednohrané_vrcholy[0])
#včíl projdu už upravený, správně natočený graf a načtu všechny body
najdu_body_pro_hrany_v_grafu(graf)
def test_edges(self):
graph = Graph()
graph.add_node(1)
graph.add_node(2)
graph.add_node(3)
graph.add_node(4)
graph.add_node(5)
self.assertTrue(isinstance(graph.edge_list(), list))
graph.add_edge(1, 2)
graph.add_edge(4, 5, 'a')
self.assertRaises(GraphError, graph.add_edge, 'a', 'b', create_nodes=False)
self.assertEqual(graph.number_of_hidden_edges(), 0)
self.assertEqual(graph.number_of_edges(), 2)
e = graph.edge_by_node(1, 2)
self.assertTrue(isinstance(e, int))
graph.hide_edge(e)
self.assertEqual(graph.number_of_hidden_edges(), 1)
self.assertEqual(graph.number_of_edges(), 1)
e2 = graph.edge_by_node(1, 2)
self.assertTrue(e2 is None)
graph.restore_edge(e)
e2 = graph.edge_by_node(1, 2)
self.assertEqual(e, e2)
self.assertEqual(graph.number_of_hidden_edges(), 0)
self.assertEqual(graph.number_of_edges(), 2)
e1 = graph.edge_by_node(1, 2)
e2 = graph.edge_by_node(4, 5)
graph.hide_edge(e1)
graph.hide_edge(e2)
self.assertEqual(graph.number_of_edges(), 0)
graph.restore_all_edges()
self.assertEqual(graph.number_of_edges(), 2)
self.assertEqual(graph.edge_by_id(e1), (1,2))
self.assertRaises(GraphError, graph.edge_by_id, (e1+1)*(e2+1)+1)
self.assertEqual(list(sorted(graph.edge_list())), [e1, e2])
self.assertEqual(graph.describe_edge(e1), (e1, 1, 1, 2))
self.assertEqual(graph.describe_edge(e2), (e2, 'a', 4, 5))
self.assertEqual(graph.edge_data(e1), 1)
self.assertEqual(graph.edge_data(e2), 'a')
self.assertEqual(graph.head(e2), 4)
self.assertEqual(graph.tail(e2), 5)
graph.add_edge(1, 3)
graph.add_edge(1, 5)
graph.add_edge(4, 1)
self.assertEqual(list(sorted(graph.out_nbrs(1))), [2, 3, 5])
self.assertEqual(list(sorted(graph.inc_nbrs(1))), [4])
self.assertEqual(list(sorted(graph.inc_nbrs(5))), [1, 4])
self.assertEqual(list(sorted(graph.all_nbrs(1))), [2, 3, 4, 5])
graph.add_edge(5, 1)
self.assertEqual(list(sorted(graph.all_nbrs(5))), [1, 4])
self.assertEqual(graph.out_degree(1), 3)
self.assertEqual(graph.inc_degree(2), 1)
self.assertEqual(graph.inc_degree(5), 2)
self.assertEqual(graph.all_degree(5), 3)
v = graph.out_edges(4)
self.assertTrue(isinstance(v, list))
self.assertEqual(graph.edge_by_id(v[0]), (4, 5))
v = graph.out_edges(1)
for e in v:
self.assertEqual(graph.edge_by_id(e)[0], 1)
v = graph.inc_edges(1)
self.assertTrue(isinstance(v, list))
self.assertEqual(graph.edge_by_id(v[0]), (4, 1))
v = graph.inc_edges(5)
for e in v:
self.assertEqual(graph.edge_by_id(e)[1], 5)
v = graph.all_edges(5)
for e in v:
self.assertTrue(graph.edge_by_id(e)[1] == 5 or graph.edge_by_id(e)[0] == 5)
e1 = graph.edge_by_node(1, 2)
self.assertTrue(isinstance(e1, int))
graph.hide_node(1)
self.assertRaises(GraphError, graph.edge_by_node, 1, 2)
graph.restore_node(1)
e2 = graph.edge_by_node(1, 2)
self.assertEqual(e1, e2)
