package ocamlgraph

  1. Overview
  2. Docs
package ocamlgraph
Legend:
Library
Module
Module type
Parameter
Class
Class type

Strongly connected components.

module type G = sig ... end

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

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

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 (G : U) : sig ... end