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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
#include "config.h"
#include <stddef.h>
#include <assert.h>
#include <ccan/aga/aga.h>
#include <ccan/tap/tap.h>
#include "simple-graph.h"
static void test_adjacency(const char *name,
const struct simple_graph *sg,
const struct adjacency_list *at)
{
int i;
for (i = 0; at[i].from != 0; i++) {
const void *e;
struct aga_edge_info ei;
int j = 0;
const struct aga_node *from;
int err;
assert(i < MAX_NODES);
from = &sg->nodes[at[i].from];
aga_for_each_edge_info(e, ei, err, &sg->g, from) {
const struct aga_node *cmpto;
assert(j < MAX_EDGES);
cmpto = &sg->nodes[at[i].to[j]];
ok(cmpto == ei.to,
"%s: %p #%d -> #%ld (expected #%d -> #%d)", name, e,
at[i].from, (ei.to - sg->nodes),
at[i].from, at[i].to[j]);
j++;
}
if (at[i].to[j] < 0) {
ok(err == at[i].to[j], "%s: %p #%d -> ERROR %d",
name, e, at[i].from, at[i].to[j]);
continue; /* Move onto next node on errors */
}
assert(j < MAX_EDGES);
ok(at[i].to[j] == 0,
"%s: %p #%d -> --- (expected #%d -> #%d)", name, e,
at[i].from, at[i].from, at[i].to[j]);
}
}
int main(void)
{
struct trivial_graph tg;
struct parallel_graph pg;
struct full_graph fg;
struct chain_graph cg;
struct grid_graph gg1, gg2;
struct error_graph eg;
struct traversal1_graph t1g;
plan_tests(1 + 5 + 30 + 22 + 21 + 33 + 6 + 21);
trivial_graph_init(&tg);
test_adjacency("trivial", &tg.sg, trivial_adjacency);
parallel_graph_init(&pg, 3);
test_adjacency("parallel nlinks 3", &pg.sg,
parallel_adjacency_nlinks3);
full_graph_init(&fg, 5);
test_adjacency("full 5", &fg.sg, full_adjacency_5);
chain_graph_init(&cg, 8);
test_adjacency("chain 8", &cg.fg.sg, chain_adjacency_8);
grid_graph_init(&gg1, 3, 3, true, true, false, false);
test_adjacency("grid 3x3 right-down", &gg1.sg,
grid_adjacency_3x3_rightdown);
grid_graph_init(&gg2, 3, 3, true, true, true, true);
test_adjacency("grid 3x3 all", &gg2.sg,
grid_adjacency_3x3_all);
error_graph_init(&eg);
test_adjacency("error graph", &eg.sg, error_adjacency);
traversal1_graph_init(&t1g);
test_adjacency("traversal1 graph", &t1g.sg, traversal1_adjacency);
return exit_status();
}
|
