Function test_noPaths

tests/unit/test_all_paths.c:92–111

}

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

	NodeID       src_id = 0;
	unsigned int minLen = 999;
	unsigned int maxLen = minLen + 1;

	Node src;
	Graph_GetNode(g, src_id, &src);

	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 *p = AllPathsCtx_NextPath(ctx);

	TEST_ASSERT(p == NULL);

	AllPathsCtx_Free(ctx);
	Graph_Free(g);
}

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