package topological_sort

You can search for identifiers within the package.

in-package search v0.2.0

topological_sort
- CHANGES
- LICENSE
- Library topological_sort
  - Topological_sort
    
    Node
    
    Edge
    
    What
- Sources
  - topological_sort
    
    import.ml
    
    topological_sort.ml
    
    topological_sort__.ml
    
    topological_sort_intf.ml

Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module `Topological_sort`Source

Sourcemodule type Node = sig ... end

Sourcemodule Edge : sig ... end

Sourcemodule What : sig ... end

Source

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.

package topological_sort

Module Topological_sortSource

Module `Topological_sort`Source