| Sig |
Signatures for graph implementations.
|
| Sig_pack |
Immediate access to the library: contain a signature gathering an
imperative graph signature and all algorithms.
|
| Dot_ast |
AST for DOT file format.
|
| Util |
Some useful operations.
|
| Persistent |
Persistent Graph Implementations.
|
| Imperative |
Imperative Graph Implementations.
|
| Delaunay |
Delaunay triangulation.
|
| Builder |
Graph builders in order to persistent/imperative graphs sharing a same
signature.
|
| Classic |
Some classic graphs
|
| Rand |
Random graph generation.
|
| Oper |
Basic operations over graphs
|
| Path |
Paths
|
| Traverse |
Graph traversal.
|
| Coloring | k-coloring of undirected graphs.
|
| Topological |
Topological order.
|
| Components |
Strongly connected components.
|
| Kruskal |
Kruskal's algorithm.
|
| Flow |
Algorithms on flows
|
| Graphviz |
Interface with GraphViz
|
| Gml |
Parser and pretty-printer for GML file format.
|
| Dot |
Parser for DOT file format.
|
| Pack |
Immediate access to the library: provides implementation of imperative
graphs labeled with integer as well as algorithms on such graphs.
|
| Gmap |
Graph mapping.
|
| Minsep |
Minimal separators of a graph
|
| Cliquetree |
Construction of the clique tree of a graph and recognition
of chordal graphs.
|
| Mcs_m |
Maximal Cardinality Search (MCS-M) algorithm
|
| Md |
Minimum Degree algorithm
|
| Strat |
Strategies
|