Skip to main content

bidijkstra_arranged

differential_dataflow::algorithms::graphs::bijkstra

Function bidijkstra_arranged 

Source 
pub fn bidijkstra_arranged<'scope, N, Tr>(
    forward: Arranged<'scope, Tr>,
    reverse: Arranged<'scope, Tr>,
    goals: VecCollection<'scope, Tr::Time, (N, N)>,
) -> VecCollection<'scope, Tr::Time, ((N, 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

Bi-directional Dijkstra search using arranged forward and reverse edge collections.