Debian Codegraph @

test/contrib/automotive/scanner/graph.uts

raw
1 % Regression tests for graph
2
3 + Load general modules
4
5 = Load contribution layer
6
7 from scapy.contrib.automotive.scanner.graph import *
8 import pickle
9 import io
10
11 + Graph tests
12
13 = Basic test
14
15 g = Graph()
16 g.add_edge(("1", "1"))
17 g.add_edge(("1", "2"))
18 g.add_edge(("2", "3"))
19 g.add_edge(("3", "4"))
20 g.add_edge(("4", "4"))
21
22 assert "1" in g.nodes
23 assert "2" in g.nodes
24 assert "3" in g.nodes
25 assert "4" in g.nodes
26 assert len(g.nodes) == 4
27 assert g.dijkstra(g, "1", "4") == ["1", "2", "3", "4"]
28
29 = Shortest path test
30
31 g = Graph()
32 g.add_edge(("1", "1"))
33 g.add_edge(("1", "2"))
34 g.add_edge(("2", "3"))
35 g.add_edge(("3", "4"))
36 g.add_edge(("4", "4"))
37
38 assert g.dijkstra(g, "1", "4") == ["1", "2", "3", "4"]
39
40 g.add_edge(("1", "4"))
41
42 assert g.dijkstra(g, "1", "4") == ["1", "4"]
43
44 g.add_edge(("3", "5"))
45 g.add_edge(("5", "6"))
46
47 print(g.dijkstra(g, "1", "6"))
48
49 assert g.dijkstra(g, "1", "6") == ["1", "2", "3", "5", "6"] or \
50 g.dijkstra(g, "1", "6") == ['1', '4', '3', '5', '6']
51
52 g.add_edge(("2", "5"))
53
54 print(g.dijkstra(g, "1", "6"))
55
56 assert g.dijkstra(g, "1", "6") == ["1", "2", "5", "6"]
57
58 = graph add transition function
59
60 g.add_edge(("4", "6"), transition_function=(str, str))
61
62 assert g.dijkstra(g, "1", "6") == ["1", "4", "6"]
63
64 = graph pickle
65
66 f = io.BytesIO()
67
68 pickle.dump(g, f)
69 unp = pickle.loads(f.getvalue())
70
71 assert unp.dijkstra(g, "1", "6") == ["1", "4", "6"]
72
73 f1, f2 = unp.get_transition_tuple_for_edge(("4", "6"))
74 assert f1==f2
75 assert "1" == f1(1)