RC-SPP + Yen's K-best
Resource-constrained shortest-path search respects train length, weight, and ETCS level. Yen's algorithm returns up to 10 alternative routes sorted by distance — useful when the primary corridor is congested.
ETCS-validated braking
Every segment gets a blocking-time profile computed from ETCS L1/L2 deceleration curves. Headways and travel times match what dispatchers expect from UIC 406 methodology.
One graph, 27 networks
Topology imported from OpenStreetMap for every EU operating point plus GB. Cross-border edges connect national fragments into a single queryable network.