Agda-2.6.0: A dependently typed functional programming language and proof assistant

Agda.Utils.Graph.TopSort

topSort :: Ord n => [n] -> [(n, n)] -> Maybe [n] Source #

topoligical sort with smallest-numbered available vertex first | input: nodes, edges | output is Nothing if the graph is not a DAG