pub fn dijkstra(graph: &Graph, start: usize) -> Vec<f64>Expand description
Dijkstra’s shortest-path algorithm from start.
Returns a vector dist where dist[i] is the shortest distance from start to node i.
Unreachable nodes have distance f64::INFINITY.
Panics if any edge weight is negative.