MCPcopy Create free account
hub / github.com/RedisGraph/RedisGraph / AllPathsCtx_NextPath

Function AllPathsCtx_NextPath

src/algorithms/all_paths.c:291–298  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

289}
290
291Path *AllPathsCtx_NextPath(AllPathsCtx *ctx) {
292 if (!ctx || ctx->maxLen == 0) return NULL;
293
294 if (ctx->shortest_paths)
295 return AllShortestPaths_NextPath(ctx);
296 else
297 return _AllPathsCtx_NextPath(ctx);
298}
299
300void AllPathsCtx_Free(AllPathsCtx *ctx) {
301 if(!ctx) return;

Callers 6

test_noPathsFunction · 0.85
test_longest_PathsFunction · 0.85
test_upToThreeLegsPathsFunction · 0.85
test_twoLegPathsFunction · 0.85

Calls 2

_AllPathsCtx_NextPathFunction · 0.85

Tested by 5

test_noPathsFunction · 0.68
test_longest_PathsFunction · 0.68
test_upToThreeLegsPathsFunction · 0.68
test_twoLegPathsFunction · 0.68