pub fn iter_nodes<'a, G>(graph: &'a G, start: &[NodeId]) -> NodeVisit<'a, G> ⓘwhere
G: SwhLabeledForwardGraph,Expand description
Iterate on the nodes of the sub-graph rooted at start, in BFS order.
start is usually a single node id, passed as &[node], but can be a
non-singleton slice of nodes, to avoid independently re-visiting shared
sub-graphs from multiple starting points.
See NodeVisit documentation for performance considerations.