pub fn dijkstra(g: &Adjacency, s: usize, t: usize) -> Option<(Vec<usize>, f32)>
Weighted shortest path (Dijkstra) from s to t over the directed out view. Edge weights must be non-negative. Returns (path, cost) or None.
s
t
out
(path, cost)
None