pub fn shortest_cycle<'a, T: Ord + Hash>( dependency_graph: &DiGraphMap<&'a T, ()>, start: &'a T) -> Vec<&'a T>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator,
impl<A> Write for Vec<u8, A> where A: Allocator,