Module Graph.ComponentsSource

Strongly connected components.

Sourcemodule type G = sig ... end

Minimal graph signature required by Make. Sub-signature of Sig.G.

Sourcemodule Make (G : G) : sig ... end

Functor providing functions to compute strongly connected components of a graph.

Connectivity in strongly connected directed graphs

Sourcemodule Connectivity (GB : Builder.S) : sig ... end
Sourcemodule BiConnectivity (G : Sig.G) : sig ... end

Connected components (for undirected graphs). The implementation uses union-find. Time complexity is (quasi) O(V+E). Space complexity is O(V).

Sourcemodule type U = sig ... end
Sourcemodule Undirected (G : U) : sig ... end