differential_dataflow::algorithms::graphs::bijkstra

Function bidijkstra_arranged

Source 
pub fn bidijkstra_arranged<G, N, Tr>(
    forward: &Arranged<G, Tr>,
    reverse: &Arranged<G, Tr>,
    goals: &Collection<G, (N, N)>,
) -> Collection<G, ((N, 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

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