pub fn shortest_cycle<'a, T: Ord + Hash>( dependency_graph: &DiGraphMap<&'a T, ()>, start: &'a T ) -> Vec<&'a T> ⓘ