Graph.Components
Strongly connected components.
Functor providing functions to compute strongly connected components of a graph.
Connectivity in strongly connected directed graphs
module Connectivity (GB : Builder.S) : sig ... end
module 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).
module type U = sig ... end
module Undirected (G : U) : sig ... end