package topological_sort

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
module type Node = sig ... end
module Edge : sig ... end
module What : sig ... end
val sort : ?verbose:Base.Bool.t -> (module Node with type t = 'node) -> what:What.t -> nodes:'node Base.List.t -> edges:'node Edge.t Base.List.t -> 'node Base.List.t Base.Or_error.t

sort (module Nodes) ~what ~nodes ~edges returns a list of nodes output satisfying:

  • output contains one occurrence of every node in nodes when what = Nodes, or one occurrence of every node in nodes and edges when what = Nodes_and_edge_endpoints.
  • if { from; to_ } is in edges, then from occurs before to_ in output.
  • nodes that have no incoming or outgoing edges appear sorted at the end of output.

sort returns Error if there is a cycle.

OCaml

Innovation. Community. Security.