Function test_longest_Paths

tests/unit/test_all_paths.c:113–138

}

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

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

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

	unsigned int longestPath = 0;
	while((path = AllPathsCtx_NextPath(ctx))) {
		size_t pathLen = Path_Len(path);
		if(longestPath < pathLen) longestPath = pathLen;
	}

	// 0,1,2,3,0
	TEST_ASSERT(longestPath == 4);

	AllPathsCtx_Free(ctx);
	Graph_Free(g);
}

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