Function SPpaths_single_minimal

src/procedures/proc_sp_paths.c:560–591

find the single minimal weighted path

// find the single minimal weighted path
static void SPpaths_single_minimal
(
	SinglePairCtx *ctx
) {
	// initialize the result path to worst path
	ctx->single.path   = NULL;
	ctx->single.weight = DBL_MAX;
	ctx->single.cost   = DBL_MAX;

	// get first path
	WeightedPath p = {0};
	SPpaths_next(ctx, &p, DBL_MAX);

	// iterate over all paths
	while (p.path != NULL) {
		// if the current path is better replace it
		if(p.weight < ctx->single.weight ||
			p.cost < ctx->single.cost ||
			(p.cost == ctx->single.cost &&
				Path_Len(p.path) < Path_Len(ctx->single.path))) {
			if(ctx->single.path != NULL) {
				Path_Free(ctx->single.path);
			}
			ctx->single.path = Path_Clone(p.path);
			ctx->single.weight = p.weight;
			ctx->single.cost = p.cost;
		}

		// get next path where path weight is <= result weight
		SPpaths_next(ctx, &p, ctx->single.weight);
	}
}

static void inline _add_path
(