Int (p.lsp.1.4.1.doc.lsp.stdune.Stdune.Top

val top_closure : 
  key:('a -> int) ->
  deps:('a -> 'a list Monad.Id.t) ->
  'a list ->
  ('a list, 'a list) result Monad.Id.t

Returns Error cycle in case the graph is not a DAG