package ocamlgraph
Install
dune-project
Dependency
Authors
Maintainers
Sources
sha256=20fe267797de5322088a4dfb52389b2ea051787952a8a4f6ed70fcb697482609
sha512=c4973ac03bdff52d1c8a1ed01c81e0fbe2f76486995e57ff4e4a11bcc7b1793556139d52a81ff14ee8c8de52f1b40e4bd359e60a2ae626cc630ebe8bccefb3f1
doc/ocamlgraph/Graph/index.html
Module GraphSource
module Sig : sig ... endSignatures for graph implementations.
module Sig_pack : sig ... endImmediate access to the library: contain a signature gathering an imperative graph signature and all algorithms. Vertices and edges are labeled with integers.
module Dot_ast : sig ... endAST for DOT file format.
Persistent Graph Implementations.
Imperative Graph Implementations.
Graph builders in order to persistent/imperative graphs sharing a same signature.
Strongly connected components.
Weighted graphs without negative-cycles.
Topological order.
Immediate access to the library: provides implementation of imperative graphs labeled with integer as well as algorithms on such graphs.
Construction of the clique tree of a graph and recognition of chordal graphs.
Fixpoint computation implemented using the work list algorithm. This module makes writing data-flow analysis easy.
The leader list algorithm; it generates a list of basic blocks from a directed graph. A basic block is a forward path of nodes that requires neither branching from nor into.
Edge contraction for directed, edge-labeled graphs
Provides functions to extend any module satisfying one of the signatures Sig.P, Sig.I and Builder.S .
Weak topological ordering of the vertices of a graph, as described by François Bourdoncle.
Fixpoint computation with widenings using weak topological orderings as defined by François Bourdoncle and implemented in WeakTopological.
Abstract graph model