X-Git-Url: https://git.ozlabs.org/?a=blobdiff_plain;f=ccan%2Fagar%2Ftest%2Fapi-dijkstra.c;fp=ccan%2Fagar%2Ftest%2Fapi-dijkstra.c;h=4b03bc6b8fcd9c44b7508b98fcfacae1c3a63ba4;hb=1e742b68d026a258ccf99338f05daf8b694978a3;hp=0000000000000000000000000000000000000000;hpb=f9274cce2171d919d72fe9ec186320f85174b7e5;p=ccan

diff --git a/ccan/agar/test/api-dijkstra.c b/ccan/agar/test/api-dijkstra.c
new file mode 100644
index 00000000..4b03bc6b
--- /dev/null
+++ b/ccan/agar/test/api-dijkstra.c
@@ -0,0 +1,229 @@
+#include "config.h"
+
+#include <stddef.h>
+#include <assert.h>
+#include <stdlib.h>
+
+#include <ccan/tap/tap.h>
+#include <ccan/tal/tal.h>
+#include <ccan/array_size/array_size.h>
+
+#include <ccan/agar/agar.h>
+
+#include "simple-graphr.h"
+
+static void test_trivial(void)
+{
+	struct trivial_graphr tgr;
+	struct agar_state *sr;
+	aga_icost_t cost;
+	const void *node;
+
+	trivial_graphr_init(&tgr);
+
+	ok1(sr = agar_dijkstra_new(NULL, &tgr.gr, int2ptr(1)));
+	ok1(agar_dijkstra_step(sr, &node));
+	ok1(ptr2int(node) == 1);
+	ok1(!agar_dijkstra_step(sr, &node));
+	ok1(agar_dijkstra_path(sr, int2ptr(1), &cost, NULL, NULL));
+	ok1(cost == 0);
+	tal_free(sr);
+}
+
+static void test_parallel(void)
+{
+	struct parallel_graphr pgr;
+	struct agar_state *sr;
+	aga_icost_t cost;
+	const void *node;
+
+	parallel_graphr_init(&pgr, 3);
+
+	ok1(sr = agar_dijkstra_new(NULL, &pgr.gr, int2ptr(1)));
+	ok1(agar_dijkstra_step(sr, &node));
+	ok1(ptr2int(node) == 1);
+	ok1(agar_dijkstra_step(sr, &node));
+	ok1(ptr2int(node) == 2);
+	ok1(!agar_dijkstra_step(sr, &node));
+	ok1(agar_dijkstra_path(sr, int2ptr(1), &cost, NULL, NULL));
+	ok1(cost == 0);
+	ok1(agar_dijkstra_path(sr, int2ptr(2), &cost, &node, NULL));
+	ok1(cost == 1);
+	ok1(node == int2ptr(1));
+	tal_free(sr);
+
+	ok1(sr = agar_dijkstra_new(NULL, &pgr.gr, int2ptr(2)));
+	ok1(agar_dijkstra_step(sr, &node));
+	ok1(ptr2int(node) == 2);
+	ok1(!agar_dijkstra_step(sr, &node));
+	ok1(agar_dijkstra_path(sr, int2ptr(2), &cost, NULL, NULL));
+	ok1(cost == 0);
+	ok1(!agar_dijkstra_path(sr, int2ptr(1), NULL, NULL, NULL));
+	tal_free(sr);
+}
+
+#define FULL_LEN	4
+
+static void test_full(void)
+{
+	struct full_graphr fgr;
+	int i, j;
+
+	full_graphr_init(&fgr, FULL_LEN);
+
+	for (i = 1; i <= FULL_LEN; i++) {
+		struct agar_state *sr;
+
+		ok1(sr = agar_dijkstra_new(NULL, &fgr.gr, int2ptr(i)));
+
+		for (j = 1; j <= FULL_LEN; j++) {
+			aga_icost_t cost;
+			const void *node, *edge;
+
+			ok1(agar_dijkstra_path(sr, int2ptr(j),
+					      &cost, &node, &edge));
+			if (i == j) {
+				ok1(cost == 0);
+			} else {
+				ok1(cost == 1);
+				ok1(node == int2ptr(i));
+				ok1(edge == int2ptr(j));
+			}
+		}
+
+		tal_free(sr);
+	}
+}
+
+#define CHAIN_LEN	8
+
+static void test_chain(void)
+{
+	struct chain_graphr cgr;
+	int i, j;
+
+	chain_graphr_init(&cgr, CHAIN_LEN);
+
+	for (i = 1; i <= CHAIN_LEN; i++) {
+		struct agar_state *sr;
+
+		ok1(sr = agar_dijkstra_new(NULL, &cgr.fgr.gr, int2ptr(i)));
+
+		for (j = 1; j <= CHAIN_LEN; j++) {
+			aga_icost_t cost;
+
+			ok1(agar_dijkstra_path(sr, int2ptr(j),
+					      &cost, NULL, NULL));
+			ok1(cost == labs(i - j));
+		}
+
+		tal_free(sr);
+	}
+}
+
+static void test_error(void)
+{
+	struct error_graphr egr;
+	struct agar_state *sr;
+	aga_icost_t cost;
+
+	error_graphr_init(&egr);
+
+	ok1(sr = agar_dijkstra_new(NULL, &egr.gr, int2ptr(1)));
+	ok1(agar_dijkstra_path(sr, int2ptr(1), &cost, NULL, NULL));
+	ok1(cost == 0);
+	ok1(agar_dijkstra_path(sr, int2ptr(2), &cost, NULL, NULL));
+	ok1(cost == 1);
+	ok1(!agar_dijkstra_path(sr, int2ptr(3), &cost, NULL, NULL));
+	ok1(!agar_dijkstra_path(sr, int2ptr(4), &cost, NULL, NULL));
+	tal_free(sr);
+
+	ok1(sr = agar_dijkstra_new(NULL, &egr.gr, int2ptr(3)));
+	ok1(agar_dijkstra_path(sr, int2ptr(3), &cost, NULL, NULL));
+	ok1(cost == 0);
+	ok1(!agar_dijkstra_path(sr, int2ptr(4), &cost, NULL, NULL));
+	ok1(agar_error(sr) == -1);
+	tal_free(sr);
+}
+
+static void test_traversal1(void)
+{
+	struct traversal1_graphr t1gr;
+	struct agar_state *sr;
+	aga_icost_t cost;
+
+	/* This is mostly about testing we correctly handle
+	 * non-reachable nodes */
+	traversal1_graphr_init(&t1gr);
+
+	ok1(sr = agar_dijkstra_new(NULL, &t1gr.gr, int2ptr(1)));
+	ok1(agar_dijkstra_path(sr, int2ptr(1),
+			      &cost, NULL, NULL));
+	ok1(cost == 0);
+	ok1(agar_dijkstra_path(sr, int2ptr(2),
+			      &cost, NULL, NULL));
+	ok1(cost == 1);
+	ok1(agar_dijkstra_path(sr, int2ptr(3),
+			      &cost, NULL, NULL));
+	ok1(cost == 1);
+	ok1(agar_dijkstra_path(sr, int2ptr(4),
+			      &cost, NULL, NULL));
+	ok1(cost == 2);
+	ok1(agar_dijkstra_path(sr, int2ptr(5),
+			      &cost, NULL, NULL));
+	ok1(cost == 2);
+	ok1(agar_dijkstra_path(sr, int2ptr(6),
+			      &cost, NULL, NULL));
+	ok1(cost == 2);
+	ok1(!agar_dijkstra_path(sr, int2ptr(7),
+			       NULL, NULL, NULL));
+	ok1(!agar_dijkstra_path(sr, int2ptr(8),
+			       NULL, NULL, NULL));
+	ok1(!agar_dijkstra_path(sr, int2ptr(9),
+			       NULL, NULL, NULL));
+	tal_free(sr);
+
+	ok1(sr = agar_dijkstra_new(NULL, &t1gr.gr, int2ptr(9)));
+	ok1(agar_dijkstra_path(sr, int2ptr(9),
+			      &cost, NULL, NULL));
+	ok1(cost == 0);
+	ok1(agar_dijkstra_path(sr, int2ptr(8),
+			      &cost, NULL, NULL));
+	ok1(cost == 1);
+	ok1(agar_dijkstra_path(sr, int2ptr(7),
+			      &cost, NULL, NULL));
+	ok1(cost == 1);
+	ok1(agar_dijkstra_path(sr, int2ptr(6),
+			      &cost, NULL, NULL));
+	ok1(cost == 2);
+	ok1(agar_dijkstra_path(sr, int2ptr(5),
+			      &cost, NULL, NULL));
+	ok1(cost == 2);
+	ok1(agar_dijkstra_path(sr, int2ptr(4),
+			      &cost, NULL, NULL));
+	ok1(cost == 2);
+	ok1(!agar_dijkstra_path(sr, int2ptr(3),
+			       NULL, NULL, NULL));
+	ok1(!agar_dijkstra_path(sr, int2ptr(2),
+			       NULL, NULL, NULL));
+	ok1(!agar_dijkstra_path(sr, int2ptr(1),
+			       NULL, NULL, NULL));
+	tal_free(sr);
+}
+
+int main(void)
+{
+	plan_tests(6 + 18
+		   + FULL_LEN * (FULL_LEN*4 - 1)
+		   + CHAIN_LEN * (1 + CHAIN_LEN*2)
+		   + 12 + 32);
+
+	test_trivial();
+	test_parallel();
+	test_full();
+	test_chain();
+	test_error();
+	test_traversal1();
+	
+	return exit_status();
+}