--- /dev/null
+#include "config.h"
+
+#include <stddef.h>
+#include <assert.h>
+
+#include <ccan/tal/tal.h>
+#include <ccan/tap/tap.h>
+#include <ccan/array_size/array_size.h>
+#include <ccan/ptrint/ptrint.h>
+
+#include <ccan/agar/agar.h>
+
+#include "simple-graphr.h"
+
+#define test_bfs_partial(sr, first, ...) \
+ do { \
+ int cmp[] = { __VA_ARGS__ }; \
+ bool stillok = true; \
+ const void *node; \
+ int i = 0; \
+ agar_bfs(node, (sr), int2ptr(first)) { \
+ int index = ptr2int(node); \
+ diag("Visited %d\n", index); \
+ if (i >= ARRAY_SIZE(cmp) || (index != cmp[i])) \
+ stillok = false; \
+ i++; \
+ } \
+ ok1(stillok); \
+ } while (0)
+
+#define test_bfs(gr, first, ...) \
+ do { \
+ struct agar_state *sr; \
+ ok1((sr = agar_bfs_new(NULL, (gr)))); \
+ test_bfs_partial(sr, first, __VA_ARGS__); \
+ tal_free(sr); \
+ } while (0)
+
+int main(void)
+{
+ struct trivial_graphr tgr;
+ struct parallel_graphr pgr;
+ struct full_graphr fgr;
+ struct chain_graphr cgr;
+ struct grid_graphr ggr1, ggr2;
+ struct error_graphr egr;
+ struct traversal1_graphr t1gr;
+ struct agar_state *sr;
+ const void *nr;
+
+ plan_tests(2 * 13 + 12 + 10);
+
+ trivial_graphr_init(&tgr);
+ test_bfs(&tgr.gr, 1, 1);
+
+ parallel_graphr_init(&pgr, 3);
+ test_bfs(&pgr.gr, 1, 1, 2);
+
+ full_graphr_init(&fgr, 5);
+ test_bfs(&fgr.gr, 1, 1, 2, 3, 4, 5);
+ test_bfs(&fgr.gr, 3, 3, 1, 2, 4, 5);
+
+ chain_graphr_init(&cgr, 8);
+ test_bfs(&cgr.fgr.gr, 1, 1, 2, 3, 4, 5, 6, 7, 8);
+ test_bfs(&cgr.fgr.gr, 8, 8, 7, 6, 5, 4, 3, 2, 1);
+ test_bfs(&cgr.fgr.gr, 5, 5, 4, 6, 3, 7, 2, 8, 1);
+
+ grid_graphr_init(&ggr1, 3, 3, true, true, false, false);
+ test_bfs(&ggr1.gr, 1, 1, 2, 4, 3, 5, 7, 6, 8, 9);
+ test_bfs(&ggr1.gr, 5, 5, 6, 8, 9);
+ test_bfs(&ggr1.gr, 9, 9);
+
+ grid_graphr_init(&ggr2, 3, 3, true, true, true, true);
+ test_bfs(&ggr2.gr, 1, 1, 2, 4, 3, 5, 7, 6, 8, 9);
+ test_bfs(&ggr2.gr, 5, 5, 6, 8, 4, 2, 9, 3, 7, 1);
+ test_bfs(&ggr2.gr, 9, 9, 8, 6, 7, 5, 3, 4, 2, 1);
+
+ error_graphr_init(&egr);
+ test_bfs(&egr.gr, 1, 1, 2);
+ ok((sr = agar_bfs_new(NULL, &egr.gr)), "started error traversal");
+ ok1(agar_bfs_explore(sr, int2ptr(3), &nr));
+ ok(ptr2int(nr) == 3, "Expected node #3, actually #%ld", ptr2int(nr));
+ ok1(agar_bfs_explore(sr, nr, &nr));
+ ok(ptr2int(nr) == 4, "Expected node #4, actually #%ld", ptr2int(nr));
+ ok1(!agar_bfs_explore(sr, nr, &nr));
+ ok1(agar_error(sr) == -1);
+ ok1(!agar_bfs_explore(sr, nr, &nr));
+ tal_free(sr);
+ test_bfs(&egr.gr, 1, 1, 2);
+
+ traversal1_graphr_init(&t1gr);
+ test_bfs(&t1gr.gr, 1, 1, 2, 3, 4, 5, 6);
+ test_bfs(&t1gr.gr, 9, 9, 8, 7, 6, 5, 4);
+
+ ok1((sr = agar_bfs_new(NULL, &t1gr.gr)));
+ test_bfs_partial(sr, 1, 1, 2, 3, 4, 5, 6);
+ test_bfs_partial(sr, 9, 9, 8, 7);
+ tal_free(sr);
+
+ ok1((sr = agar_bfs_new(NULL, &t1gr.gr)));
+ test_bfs_partial(sr, 9, 9, 8, 7, 6, 5, 4);
+ test_bfs_partial(sr, 1, 1, 2, 3);
+ tal_free(sr);
+
+ return exit_status();
+}