Signatures for graph implementations.
Immediate access to the library: contain a signature gathering an imperative graph signature and all algorithms.
AST for DOT file format.
Some useful operations.
Persistent Graph Implementations.
Imperative Graph Implementations.
Graph builders in order to persistent/imperative graphs sharing a same signature.
Some classic graphs
Random graph generation.
Basic operations over graphs
Strongly connected components.
Weighted graphs without negative-cycles.
Kruskal's minimum-spanning-tree algorithm.
Algorithms on flows
Functor providing an implementation of Prim's minimum-spanning-tree algorithm.
Interface with GraphViz
Parser and pretty-printer for GML file format.
Parser for DOT file format.
Immediate access to the library: provides implementation of imperative graphs labeled with integer as well as algorithms on such graphs.
Minimal separators of a graph
Construction of the clique tree of a graph and recognition of chordal graphs.
Maximal Cardinality Search (MCS-M) algorithm
Minimum Degree algorithm
Fixpoint computation implemented using the work list algorithm.
The leader list algorithm; it generates a list of basic blocks from a directed graph.
Edge contraction for directed, edge-labeled graphs
Generic GraphMl Printer
Provides functions to extend any module satisfying one of the signatures Sig.P, Sig.I and Builder.S .
Minimal cutset of a graph
Parses xdot drawing operations
Reads layout information from xdot ASTs
Abstract graph model
This functor creates a model centered on a vertex from a graph
View items for the different elements of a graph.