0 Graph : Type -> TypeA dependency graph
invertGraph : Ord a => Graph a -> Graph aReturns the graph with all edges inverted
dependencyGraph : SortedMap PkgName (ResolvedLib t) -> Graph PkgNamerecord Tree : Type -> TypeFunctor Tree.label : Tree a -> alabel : Tree a -> a.deps : Tree a -> List (Tree a)deps : Tree a -> List (Tree a)filter : (a -> Bool) -> Tree a -> Maybe (Tree a)0 TreeMap : Type -> TypetreeMap : Ord a => Graph a -> TreeMap achildMap : SortedMap PkgName (ResolvedLib t) -> TreeMap PkgNameparentMap : SortedMap PkgName (ResolvedLib t) -> TreeMap PkgNametreeLookup : Ord a => a -> TreeMap a -> Tree aprettyTree : Interpolation a => Bool -> Tree a -> String