ccan/agar/test/full.c


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

#include "config.h"

#include <stdlib.h>
#include <assert.h>

#include <ccan/container_of/container_of.h>
#include <ccan/ptrint/ptrint.h>

#include <ccan/agar/agar.h>

#include "simple-graphr.h"

const void *full_first_edge_r(const struct agar_graph *gr,
			      const void *nr)
{
	return int2ptr(1);
}

const void *full_next_edge_r(const struct agar_graph *gr,
			     const void *nr, const void *e)
{
	struct full_graphr *fgr = container_of(gr, struct full_graphr, gr);
	int ni = ptr2int(e);

	ni += 1;
	if (ni <= fgr->nnodes)
		return int2ptr(ni);
	else
		return NULL;
}

static int full_edge_info_r(const struct agar_graph *gr,
			    const void *nr, const void *edge,
			    struct agar_edge_info *eir)
{
	eir->to = edge;
	return 0;
}

void full_graphr_init(struct full_graphr *fgr, int nnodes)
{
	fgr->nnodes = nnodes;
	agar_init_graph(&fgr->gr, full_first_edge_r, full_next_edge_r,
			full_edge_info_r);
}