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/Flow/index.html

Module Graph.FlowSource

Algorithms on flows

The following flow algorithms only apply to networks, that are directed graphs together with a source (a 0 in-degree vertex) and a terminal (a 0 out-degree vertex).

Maximum flow algorithms

Sourcemodule type FLOW = sig ... end

Signature for edges' flow.

Goldberg-Tarjan maximal flow algorithm

Sourcemodule type G_GOLDBERG_TARJAN = sig ... end

Minimal graph signature for Goldberg-Tarjan. Sub-signature of Sig.G.

Sourcemodule Goldberg_Tarjan (G : G_GOLDBERG_TARJAN) (F : FLOW with type label = G.E.label) : sig ... end

Ford-Fulkerson maximal flow algorithm

Sourcemodule type G_FORD_FULKERSON = sig ... end

Minimal digraph signature for Ford-Fulkerson. Sub-signature of Sig.G.

Sourcemodule type FLOWMIN = sig ... end
Sourcemodule Ford_Fulkerson (G : G_FORD_FULKERSON) (F : FLOWMIN with type label = G.E.label) : sig ... end