Skip to main content

bfs_arranged

differential_dataflow::algorithms::graphs::bfs

Function bfs_arranged 

Source 
pub fn bfs_arranged<'scope, N, Tr>(
    edges: Arranged<'scope, Tr>,
    roots: VecCollection<'scope, Tr::Time, N>,
) -> VecCollection<'scope, Tr::Time, (N, u32)>
where
    N: ExchangeData + Hash,
    Tr: TraceReader<Batch: Navigable> + Clone + 'static,
    for<'a> BatchCursor<Tr>: Cursor<Key<'a> = &'a N, Val<'a> = &'a N, Time = Tr::Time, Diff = isize>,
Expand description

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