containers.scc
Containers_scc
containers
containers.bencode
containers.cbor
containers.codegen
containers.monomorphic
containers.pp
containers.pvec
containers.top
containers.unix
type 'a iter = ('a -> unit) -> unit
module type ARG = sig ... end
module type S = sig ... end
module Make (A : ARG) : S with module A = A
val scc : tbl:(module Hashtbl.S with type key = 'node) -> graph:'graph -> children:('graph -> 'node -> 'node iter) -> nodes:'node list -> unit -> 'node list list
Compute the strongly connected components of the given graph, reachable from nodes.
graph
nodes
the graph state
maps a node to its direct descendants (children)
initial nodes.
a hashtable implementation that takes nodes as keys