pub fn shortest_path_route(
graph: &Graph,
source: usize,
target: usize,
) -> Option<(Vec<usize>, Vec<usize>, f64)>Expand description
Dijkstra with predecessor tracking, returning the shortest path from
source to target as (node path, traversed CSR slots, cost), or
None when the target is unreachable.