pub fn shortest_path(g: &CsrGraph, src: u32, dst: u32) -> Option<Vec<u32>>
Cheapest path from src to dst as a node-index sequence, or None if unreachable (or either endpoint is out of range).
src
dst
None