Function test_twoLegPaths

tests/unit/test_all_paths.c:217–268

}

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

	NodeID src_id = 0;
	Node src;
	Path *path = NULL;
	Graph_GetNode(g, src_id, &src);
	unsigned int minLen = 2;
	unsigned int maxLen = 2;
	unsigned int 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 */
	NodeID p0[3] = {0, 1, 0};
	NodeID p1[3] = {0, 1, 2};
	NodeID p2[3] = {0, 2, 1};
	NodeID p3[3] = {0, 2, 3};
	NodeID *expectedPaths[4] = {p0, p1, p2, p3};

	while((path = AllPathsCtx_NextPath(ctx))) {
		TEST_ASSERT(pathsCount < 4);
		TEST_ASSERT(Path_Len(path) == 2);
		bool expectedPathFound = false;

		for(int i = 0; i < 4; i++) {
			NodeID *expectedPath = expectedPaths[i];
			int j;
			for(j = 0; j < 3; j++) {
				Node n = path->nodes[j];
				if(ENTITY_GET_ID(&n) != expectedPath[j]) break;
			}
			expectedPathFound = (j == 3);
			if(expectedPathFound) break;
		}

		TEST_ASSERT(expectedPathFound);
		pathsCount++;
	}

	TEST_ASSERT(pathsCount == 4);

	AllPathsCtx_Free(ctx);
	Graph_Free(g);
}

// Test all paths from source to a specific destination node.
void test_destinationSpecificPaths() {