Function differential_dataflow::algorithms::graphs::propagate::propagate [−][src]
pub fn propagate<G, N, L, R>(
edges: &Collection<G, (N, N), R>,
nodes: &Collection<G, (N, L), R>
) -> Collection<G, (N, L), R> where
G: Scope,
G::Timestamp: Lattice + Ord,
N: ExchangeData + Hash,
R: ExchangeData + Abelian,
R: Mul<R, Output = R>,
R: From<i8>,
L: ExchangeData,
Propagates labels forward, retaining the minimum label.
This algorithm naively propagates all labels at once, much like standard label propagation.
To more carefully control the label propagation, consider propagate_core
which supports a
method to limit the introduction of labels.