package lsp
Module Top_closure.IntSource
Source
val top_closure :
key:('a -> int) ->
deps:('a -> 'a list Monad.Id.t) ->
'a list ->
('a list, 'a list) result Monad.Id.tReturns Error cycle in case the graph is not a DAG