Function differential_dataflow::algorithms::graphs::propagate::propagate

pub fn propagate<G, N, L>(
    edges: &Collection<G, (N, N)>,
    nodes: &Collection<G, (N, L)>
) -> Collection<G, (N, L)>where
    G: Scope,
    G::Timestamp: Lattice + Ord,
    N: Data + Hash,
    L: Data,

Propagates labels forward, retaining the minimum label.