TideknotA little room to reroute.
Find the route that can carry the load.
Then ask what it costs.
01 / The network
03 / Paths, side by side
FEASIBILITY FIRST · THEN COST| Path | Feasibility | Usable capacity | Total cost | Bottleneck edges |
|---|
Keep the conditions.
Revisit the choice.
Saved in this browser. Export a portable recipe to keep elsewhere.
How this model works +
Every simple directed path from S to T is enumerated. A path is feasible when its smallest usable edge capacity is at least the demand. Usable capacity = capacity × (1 − congestion / 100). Total cost = demand × sum of edge unit costs. All tied bottlenecks are listed.
This compares a single path carrying the whole demand. It does not optimize split flows, model market slippage or submit transactions. Inputs are illustrative abstract units; results are deterministic.
More ways to untie a knot.
Tideknot Flow / KNOT is planned for advanced routing scenarios, batch comparisons and shared routing recipes. The local laboratory is free and does not issue or consume tokens.