A | |
| Abstract [Imperative.S] |
Abstract Imperative Unlabeled Graphs
|
| Abstract [Persistent.S] |
Abstract Persistent Unlabeled Graphs
|
| AbstractLabeled [Imperative.S] |
Abstract Imperative Labeled Graphs
|
| AbstractLabeled [Persistent.S] |
Abstract Persistent Labeled Graphs
|
B | |
| Bfs [Traverse] |
Breadth-first search
|
| Bfs [Sig_pack.S] |
Breadth-first search
|
| Builder |
Graph builders
|
C | |
| CVS [Cliquetree.CliqueTree] |
Set of original vertices
|
| Check [Path] | |
| Choose [Oper] |
Choose an element in a graph
|
| Classic |
Some classic graphs
|
| Classic [Sig_pack.S] |
Classic graphs
|
| CliqueTree [Cliquetree.CliqueTree] |
The clique tree graph type
|
| CliqueTree [Cliquetree] | |
| CliqueTreeE [Cliquetree.CliqueTree] | |
| CliqueTreeV [Cliquetree.CliqueTree] |
Clique tree vertex type
|
| CliqueV [Cliquetree.CliqueTree] |
Original graph vertex
|
| Cliquetree |
Construction of the clique tree of a graph and recognition
of chordal graphs.
|
| Coloring |
k-coloring of undirected graphs.
|
| CommonAttributes [Graphviz] |
The
CommonAttributes module defines attributes for graphs,
vertices and edges that are available in the two engines, dot and neato.
|
| Components |
Strongly connected components
|
| Components [Sig_pack.S] |
Strongly connected components
|
| Concrete [Imperative.S] |
Imperative Unlabeled Graphs
|
| Concrete [Persistent.S] |
Persistent Unlabeled Graphs
|
| ConcreteBidirectional [Imperative.Digraph] |
Imperative Unlabeled, bidirectional graph (gives predecessors in
constant time)
|
| ConcreteLabeled [Imperative.S] |
Imperative Labeled Graphs
|
| ConcreteLabeled [Persistent.S] |
Persistent Labeled Graphs
|
D | |
| Delaunay |
Delaunay triangulation
|
| Dfs [Traverse] |
Depth-first search
|
| Dfs [Sig_pack.S] |
Depth-first search
|
| Digraph [Pack] |
Directed graphs
|
| Digraph [Imperative.Matrix] |
Imperative Directed Graphs implemented with adjacency matrices
|
| Digraph [Imperative] | |
| Digraph [Persistent] |
Persistent Directed Graphs
|
| Dijkstra [Path] | |
| Dot [Graphviz] | |
| DotAttributes [Graphviz] |
The
DotAttributes module defines attributes for graphs, nodes and edges
that are available in the dot engine.
|
E | |
| E [Flow.G_FORD_FULKERSON] | |
| E [Flow.G_GOLDBERG] | |
| E [Kruskal.G] | |
| E [Path.G] | |
| E [Sig_pack.S] |
Edges
|
| E [Sig.G] |
Edges have type
E.t and are labeled with type E.label.
|
| Edge [Gmap] | |
F | |
| Float [Delaunay] |
Delaunay triangulation with floating point coordinates
|
| FloatPoints [Delaunay] |
Points with floating point coordinates
|
| Flow |
Algorithms on flows
|
| Ford_Fulkerson [Flow] | |
G | |
| G [Minsep.MINSEP] |
Implementation of a graph
|
| G [Builder.S] | |
| Generic [Kruskal] | |
| Gmap |
Graph mapping
|
| Gml |
Parser for GML file format
|
| Goldberg [Flow] | |
| Graph [Pack] |
Undirected graphs
|
| Graph [Imperative.Matrix] |
Imperative Undirected Graphs implemented with adjacency matrices
|
| Graph [Imperative] |
Imperative Undirected Graphs
|
| Graph [Persistent] |
Persistent Undirected Graphs
|
| Graphviz |
Interface with GraphViz
|
H | |
| H [Coloring.Make] |
hash tables used to store the coloring
|
I | |
| I [Md] | |
| I [Mcs_m.MaximalCardinalitySearch] | |
| I [Minsep] |
Implementation for an imperative graph.
|
| I [Oper] |
Basic operations over imperative graphs
|
| I [Rand.Planar] |
Random imperative planar graphs
|
| I [Rand] |
Random imperative graphs
|
| I [Classic] |
Classic Imperative Graphs
|
| I [Builder] |
Imperative Graphs Builders
|
| Imperative |
Imperative Implementations
|
| Int [Delaunay] |
Delaunay triangulation with integer coordinates
|
| IntPoints [Delaunay] |
Points with integer coordinates
|
K | |
| Kruskal |
Kruskal's algorithm
|
M | |
| Make [Kruskal] | |
| Make [Components] | |
| Make [Topological] | |
| Make [Coloring] | |
| Make [Oper] |
Basic operations over graphs
|
| Make [Rand.Planar] |
Random planar graphs
|
| Make [Rand] |
Random graphs
|
| Make [Delaunay] |
Generic Delaunay triangulation
|
| Mark [Coloring.GM] | |
| Mark [Coloring] |
Graph coloring with marking.
|
| Mark [Traverse.GM] | |
| Mark [Traverse] |
Graph traversal with marking.
|
| Mark [Sig_pack.S] |
Vertices contains integers marks, which can be set or used by some
algorithms (see for instance module
Marking below)
|
| Mark [Sig.IM] | |
| Marking [Sig_pack.S] |
Graph traversal with marking
|
| Matrix [Imperative] |
Imperative graphs implemented as adjacency matrices
|
| MaximalCardinalitySearch [Mcs_m] | |
| Mcs_m |
Maximal Cardinality Search (MCS-M) algorithm
|
| Md |
Minimum Degree algorithm
|
| Minsep |
Minimal separators of a graph
|
N | |
| Neato [Graphviz] | |
| NeatoAttributes [Graphviz] |
The
NeatoAttributes module defines attributes for graphs, nodes and edges
that are available in the neato engine.
|
| Neighbourhood [Oper] |
Neighbourhood of vertex / vertices
|
O | |
| Oper |
Basic operations over graphs
|
P | |
| P [Md] | |
| P [Mcs_m.MaximalCardinalitySearch] | |
| P [Minsep] |
Implementation for a persistent graph
|
| P [Oper] |
Basic operations over persistent graphs
|
| P [Rand.Planar] |
Random persistent planar graphs
|
| P [Rand] |
Random persistent graphs
|
| P [Classic] |
Classic Persistent Graphs
|
| P [Builder] |
Persistent Graphs Builders
|
| Pack |
Immediate access to the library.
|
| Parse [Gml] | |
| Path |
Paths
|
| PathCheck [Sig_pack.S] |
Path checking
|
| Persistent |
Persistent Implementations
|
| Planar [Rand] | |
| Print [Gml] | |
R | |
| Rand |
Random graph generation
|
| Rand [Sig_pack.S] |
Random graphs
|
S | |
| S [Delaunay.Triangulation] | |
| Sig |
Signatures for graph implementations
|
| Sig_pack |
Immediate access to the library.
|
T | |
| Topological |
Topological order.
|
| Topological [Sig_pack.S] |
Topological order
|
| Traverse |
Graph traversal
|
V | |
| V [Minsep.G] | |
| V [Flow.G_FORD_FULKERSON] | |
| V [Flow.G_GOLDBERG] | |
| V [Kruskal.G] | |
| V [Components.G] | |
| V [Topological.G] | |
| V [Coloring.G] | |
| V [Coloring.GM] | |
| V [Traverse.GM] | |
| V [Traverse.G] | |
| V [Path.G] | |
| V [Sig_pack.S] |
Vertices
|
| V [Sig.G] |
Vertices have type
V.t and are labeled with type V.label
(note that an implementation may identify the vertex with its
label)
|
| VSetset [Minsep.MINSEP] |
Implementation of a set of
Vertex_Set
|
| Vertex [Gmap] | |
| Vertex_Set [Minsep.MINSEP] |
Implementation of a set of vertex
|
| Vertex_Set [Oper.Neighbourhood] |