Function differential_dataflow::algorithms::graphs::scc::trim

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

Iteratively removes nodes with no in-edges.