Index of module types


C
CCC [Delaunay]
Delaunay triangulation is available for any CCC system in the sense of Knuth's ``Axioms and Hulls''
COMPARABLE [Sig]

E
EDGE [Sig]

F
FLOW [Flow]
Signature for edges' flow

G
G [Minsep]
Minimal signature for computing the minimal separators
G [Kruskal]
Minimal graph signature for Kruskal
G [Components]
Minimal graph signature for scc
G [Topological]
Minimal graph signature to provide
G [Traverse]
Minimal graph signature for Dfs or Bfs
G [Path]
Minimal graph signature for Dijkstra's algorithm
G [Sig]
GM [Traverse]
Minimal graph signature for graph traversal with marking.
G_FORD_FULKERSON [Flow]
Minimal digraph signature for Ford-Fulkerson
G_GOLDBERG [Flow]
Minimal digraph signature for Goldberg

H
HASHABLE [Sig]

I
I [Sig]
IA [Sig]
INT [Builder]

M
MARK [Sig]
MINSEP [Minsep]

O
ORDERED_TYPE [Sig]
ORDERED_TYPE_DFT [Sig]

P
P [Sig]

S
S [Oper]
S [Rand]
S [Rand.Planar]
S [Classic]
S [Builder]
S [Imperative.Matrix]
S [Sig_pack]

T
Triangulation [Delaunay]
The result of triangulation is an abstract value of type triangulation.

U
UNIONFIND [Kruskal]

V
VERTEX [Sig]

W
WEIGHT [Path]
Signature for edges' weights