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

pub fn trim<G, N>(graph: &Collection<G, (N, N)>) -> Collection<G, (N, N)> where
    G: Scope,
    G::Timestamp: Lattice + Ord,
    N: ExchangeData + Hash, 

Iteratively removes nodes with no in-edges.