fn bfs(grid: &Grid<u8>, starts: &[Point], limit: u32) -> (u64, u64, u64, u64)
Breadth first search from any number of starting locations with a limit on maximum steps.