Function test_upToThreeLegsPaths

tests/unit/test_all_paths.c:140–215

}

void test_upToThreeLegsPaths() {
	Graph *g = BuildGraph();

	NodeID src_id = 0;
	Node src;
	Graph_GetNode(g, src_id, &src);

	Path *path = NULL;
	unsigned int minLen = 0;
	unsigned int maxLen = 3;
	uint pathsCount = 0;
	int relationships[] = {GRAPH_NO_RELATION};
	AllPathsCtx *ctx = AllPathsCtx_New(&src, NULL, g, relationships, 1,
		GRAPH_EDGE_DIR_OUTGOING, minLen, maxLen, NULL, NULL, 0, false);

	/* Connections:
	 * 0 -> 1
	 * 0 -> 2
	 * 1 -> 0
	 * 1 -> 2
	 * 2 -> 1
	 * 2 -> 3
	 * 3 -> 0 */

	// Zero leg paths.
	NodeID p0[2] = {0, 0};

	// One leg paths.
	NodeID p1[3] = {1, 0, 1};
	NodeID p2[3] = {1, 0, 2};

	// Two leg paths.
	NodeID p3[4] = {2, 0, 1, 0};
	NodeID p4[4] = {2, 0, 1, 2};
	NodeID p5[4] = {2, 0, 2, 1};
	NodeID p6[4] = {2, 0, 2, 3};

	// Three leg paths.
	NodeID p7[5] = {3, 0, 1, 2, 1};
	NodeID p8[5] = {3, 0, 1, 2, 3};
	NodeID p9[5] = {3, 0, 2, 1, 0};
	NodeID p10[5] = {3, 0, 2, 1, 2};
	NodeID p11[5] = {3, 0, 2, 3, 0};

	NodeID *expectedPaths[12] = {p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11};

	while((path = AllPathsCtx_NextPath(ctx))) {
		bool expectedPathFound = false;
		assert(pathsCount < 12);

		// Try to match a path.
		for(int i = 0; i < 12; i++) {
			NodeID *expectedPath = expectedPaths[i];
			size_t expectedPathLen = expectedPath[0];
			expectedPath++; // Skip path length.

			if(Path_Len(path) != expectedPathLen) continue;