pub fn dijkstra_with_path(
graph: &Graph,
start: usize,
) -> (Vec<f64>, Vec<Option<usize>>)Expand description
Dijkstra with both distances and predecessor array.
Returns (dist, prev) where prev[i] is the predecessor of node i
on the shortest path from start.