pub fn toposort_lenient<G>(graph: &G) -> ToposortData<G::V>where G: FinGraph, G::V: Hash + Debug,
Implementation of topological sort which does not return an error when it encounters cycle.