Expand description
Certified shortest paths through staged state layers.
Structs§
- Layered
Cell - One Bellman-table cell in a layered shortest-path certificate.
- Layered
Certificate - Bellman values and backpointers proving a layered optimum.
- Layered
Path - A minimum-cost path selecting one state from every layer.
Functions§
- layered_
shortest_ path - Finds the minimum-cost path selecting one state from every non-empty layer.
- layered_
shortest_ path_ with_ control - Finds a layered shortest path with forbidden transitions and explicit resource control.
- verify_
layered_ path - Verifies the Bellman recurrence, stable backpointers, selected states, and accounting evidence of a layered shortest path.