Function shortest_path 

pub fn shortest_path(
    graph: &ModalGraph,
    start: NodeId,
    goal: NodeId,
    available_modes: AllowedModes,
) -> Option<ModalRoute>

Compute the lowest-cost path from start to goal using only edges that permit at least one mode in available_modes. Returns None if unreachable.