Crate hrdf_routing_engine

Structs§

plan_journey: Finds the fastest route from the departure stop to the arrival stop. It may not be the one which takes the less time since there is no departure time optimization. The only guaratnee is that it si the route that arrives the earliest. The departure date and time must be within the timetable period.
plan_shortest_journey: Finds the route that takes the least time while arriving the earliest possioble. It basically moves from the departure stop to the arrival stop. The departure date and time must be within the timetable period.
run_average
run_comparison
run_debug
run_optimal
run_service
run_simple
run_surface_per_ha
run_worst