Module Containers_scc

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 Stdlib.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.

  • parameter graph

    the graph state

  • parameter children

    maps a node to its direct descendants (children)

  • parameter nodes

    initial nodes.

  • parameter tbl

    a hashtable implementation that takes nodes as keys