differential_dataflow::algorithms::graphs::bfs

Function bfs_arranged

Source 
pub fn bfs_arranged<G, N, Tr>(
    edges: &Arranged<G, Tr>,
    roots: &Collection<G, N>,
) -> Collection<G, (N, u32)>
where
    G: Scope,
    G::Timestamp: Lattice + Ord,
    N: ExchangeData + Hash,
    Tr: for<'a> TraceReader<Key<'a> = &'a N, Val<'a> = &'a N, Time = G::Timestamp, Diff = isize> + Clone + 'static,
Expand description

Returns pairs (node, dist) indicating distance of each node from a root.