trim

differential_dataflow::algorithms::graphs::scc

Function trim 

Source 
pub fn trim<G, N, R>(
    graph: &Collection<G, (N, N), R>,
) -> Collection<G, (N, N), R>
where
    G: Scope<Timestamp: Lattice + Ord>,
    N: ExchangeData + Hash,
    R: ExchangeData + Abelian + Multiply<R, Output = R> + From<i8>,
Expand description

Iteratively removes nodes with no in-edges.