Function differential_dataflow::algorithms::graphs::bfs::bfs_arranged

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: TraceReader<Key = N, Val = N, Time = G::Timestamp, R = isize> + Clone + 'static,
    Tr::Batch: BatchReader<N, N, G::Timestamp, Tr::R> + 'static,
    Tr::Cursor: Cursor<N, N, G::Timestamp, Tr::R> + 'static, 

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