pub fn shortest_path(g: &Adjacency, s: usize, t: usize) -> Option<Vec<usize>>
Unweighted shortest path (BFS) from s to t over the directed out view. Returns the node sequence [s, …, t], or None if t is unreachable.
s
t
out
[s, …, t]
None