Expand description
Path-based Frank-Wolfe split-routing algorithm.
Wraps BellmanFordAlgorithm to find multiple candidate paths and then
optimally split the input amount across them. The inner BF instance handles
single-path discovery; this module layers on the Frank-Wolfe optimisation
loop to determine the best split fractions.
The optimisation objective is output net of gas, evaluated by simulating paths sequentially against a shared post-swap state map — paths that share a pool see its depleted reserves instead of double-counting liquidity. The single-path route is a floor: any failure while optimising the split falls back to it rather than failing the solve.
Structs§
- Path
Frank Wolfe Algorithm - Split-routing algorithm that discovers multiple paths via Bellman-Ford and optimises the input split across them using a Frank-Wolfe loop.
- Path
Frank Wolfe Config - Tuning parameters for the path-based Frank-Wolfe split-routing loop.