1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
with Unit_Tests;
use Unit_Tests;
package Graph_Tests.Context is
function Neighbors_Check return Test_Result;
function Parents_Check return Test_Result;
function Children_Check return Test_Result;
function Outbound_Check return Test_Result;
function Inbound_Check return Test_Result;
function Between_Check return Test_Result;
function Outdegree_Check return Test_Result;
function Indegree_Check return Test_Result;
function Degree_Check return Test_Result;
function Has_Edge_Check return Test_Result;
function Has_Neighbor_Check return Test_Result;
Tests : Test_Array :=
((+"Neighbors", Neighbors_Check'Access),
(+"Parents", Parents_Check'Access),
(+"Children", Children_Check'Access),
(+"Outbound", Outbound_Check'Access),
(+"Inbound", Inbound_Check'Access),
(+"Between", Between_Check'Access),
(+"Outdegree", Outdegree_Check'Access),
(+"Indegree", Indegree_Check'Access),
(+"Degree", Degree_Check'Access),
(+"Has_Edge", Has_Edge_Check'Access),
(+"Has_Neighbor", Has_Neighbor_Check'Access));
end Graph_Tests.Context;
|
