libghc-topograph-prof 1.0.0.2-2 (armhf binary) in ubuntu noble

 Directed acyclic graphs can be sorted topographically.
 Existence of topographic ordering allows writing many graph
 algorithms efficiently. Many graphs, including most
 dependency graphs, are acyclic.
 .
 There are some algorithms built in: dfs, transpose, transitive
 closure, transitive reduction, etc.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.