package ocamlgraph

  1. Overview
  2. Docs
A generic graph library for OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

  1. S
    Sylvain Conchon
  2. J
    Jean-Christophe Filliâtre
  3. J
    Julien Signoles

Maintainers

  1. J
    jean-christophe.filliatre@cnrs.fr

Sources

ocamlgraph-2.2.0.tbz
sha256=b0956210863cc24f480203ba3c2ef06dfae5579536a05744364e7de58822b230
sha512=257cdd5fb90337b3e3682cade1269c1d181f3124e569a731909f49bbfbe581ab529ac401472fb9ef57166ac34d8ebadfa6a32c93665f38f5a335982d5e5dc0e1

doc/ocamlgraph/Graph/Components/index.html

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