fn bfs_iter<G: IntoNeighbors + Visitable<NodeId = Node, Map = <SPDGImpl as Visitable>::Map>>(
g: G,
start: impl IntoIterator<Item = Node>,
) -> WalkerIter<Bfs<Node, <G as Visitable>::Map>, G>Expand description
The current policy for this iterator is that it does not return the start nodes uness there is a cycle and a node is reachable that way.