Function AllPathsCtx_New

src/algorithms/all_paths.c:166–232

}

AllPathsCtx *AllPathsCtx_New
(
	Node *src,
	Node *dst,
	Graph *g,
	int *relationIDs,
	int relationCount,
	GRAPH_EDGE_DIR dir,
	uint minLen,
	uint maxLen,
	Record r,
	FT_FilterNode *ft,
	uint edge_idx,
	bool shortest_paths
) {
	ASSERT(src != NULL);

	AllPathsCtx *ctx = rm_malloc(sizeof(AllPathsCtx));
	ctx->g         =  g;
	ctx->r         =  r;
	ctx->ft        =  ft;
	ctx->dir       =  dir;
	ctx->edge_idx  =  edge_idx;

	// Cypher variable path "[:*min..max]"" specifies edge count
	// While the path constructed here contains only nodes.
	// As such a path which require min..max edges
	// should contain min+1..max+1 nodes.
	ctx->minLen         =  minLen + 1;
	ctx->maxLen         =  maxLen + 1;
	ctx->relationIDs    =  relationIDs;
	ctx->relationCount  =  relationCount;
	ctx->levels         =  array_new(LevelConnection *, 1);
	ctx->path           =  Path_New(1);
	ctx->neighbors      =  array_new(Edge, 32);
	ctx->dst            =  dst;
	ctx->shortest_paths =  shortest_paths;
	ctx->visited        =  NULL;

	_AllPathsCtx_EnsureLevelArrayCap(ctx, 0, 1);
	_AllPathsCtx_AddConnectionToLevel(ctx, 0, src, NULL);

	if(ctx->shortest_paths) {
		if(dst == NULL) {
			// If the destination is NULL due to a scenario like a
			// failed optional match, no results will be produced
			ctx->maxLen = 0;
			return ctx;
		}
		// get the the minimum length between src and dst
		// then start the traversal from dst to src
		int min_path_len = AllShortestPaths_FindMinimumLength(ctx, src, dst);
		ctx->minLen = min_path_len;
		ctx->maxLen = min_path_len;
		ctx->dst    = src;
		if(dir == GRAPH_EDGE_DIR_INCOMING) {
			ctx->dir = GRAPH_EDGE_DIR_OUTGOING;
		} else if(dir == GRAPH_EDGE_DIR_OUTGOING) {