Function addOutgoingNeighbors

src/algorithms/all_paths.c:43–90

}

void addOutgoingNeighbors
(
	AllPathsCtx *ctx,
	LevelConnection *frontier,
	uint32_t depth
) {
	EntityID frontierId = INVALID_ENTITY_ID;
	if(depth > 1) frontierId = ENTITY_GET_ID(&frontier->edge);

	// Get frontier neighbors.
	for(int i = 0; i < ctx->relationCount; i++) {
		Graph_GetNodeEdges(ctx->g, &frontier->node, GRAPH_EDGE_DIR_OUTGOING, ctx->relationIDs[i], &ctx->neighbors);
	}

	// Add unvisited neighbors to next level.
	uint32_t neighborsCount = array_len(ctx->neighbors);

	//--------------------------------------------------------------------------
	// apply filter to edge
	//--------------------------------------------------------------------------
	if(ctx->ft) {
		for(uint32_t i = 0; i < neighborsCount; i++) {
			Edge e = ctx->neighbors[i];

			// update the record with the current edge
			Record_AddEdge(ctx->r, ctx->edge_idx, e);

			// drop edge if it doesn't passes filter
			if(FilterTree_applyFilters(ctx->ft, ctx->r) != FILTER_PASS) {
				array_del_fast(ctx->neighbors, i);
				i--;
				neighborsCount--;
			}
		}
	}

	_AllPathsCtx_EnsureLevelArrayCap(ctx, depth, neighborsCount);
	for(uint32_t i = 0; i < neighborsCount; i++) {
		// Don't follow the frontier edge again.
		if(frontierId == ENTITY_GET_ID(ctx->neighbors + i)) continue;
		// Set the neighbor by following the edge in the correct directoin.
		Node neighbor = GE_NEW_NODE();
		Graph_GetNode(ctx->g, Edge_GetDestNodeID(ctx->neighbors + i), &neighbor);
		// Add the node and edge to the frontier.
		_AllPathsCtx_AddConnectionToLevel(ctx, depth, &neighbor, (ctx->neighbors + i));
	}
	array_clear(ctx->neighbors);
}

void addIncomingNeighbors
(