Function differential_dataflow::algorithms::graphs::bijkstra::bidijkstra_arranged

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: 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, 

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