module Components:sig
..end
Strongly connected components.
module type G =sig
..end
Minimal graph signature required by Components.Make
.
module Make:
Functor providing functions to compute strongly connected components of a graph.
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: