A | |
ANY_TYPE [Sig] | Signature with only an abstract type. |
ATTRIBUTES [Graphviz] | The |
Analysis [Fixpoint] | |
C | |
CCC [Delaunay] | Delaunay triangulation is available for any CCC system in the sense of Knuth's ``Axioms and Hulls'' |
COMPARABLE [Sig] | Signature merging |
D | |
Data [ChaoticIteration] | Parameters of the analysis. |
E | |
EDGE [Sig] | Signature for edges. |
E_DST [Gmap] | Signature for the destination graph. |
E_SRC [Gmap] | Signature for the source graph. |
F | |
FLOW [Flow] | Signature for edges' flow. |
FLOWMIN [Flow] | |
G | |
G [ChaoticIteration] | Minimal graph signature for the algorithm. |
G [WeakTopological] | Minimal graph signature for the algorithm |
G [Clique] | Minimal graph signature for Bron-Kerbosch. |
G [Mincut] | Minimal signature for computing the minimal separators |
G [Graphml] | Graph information required by Graphml |
G [Contraction] | Minimal graph signature for edge contraction algorithm |
G [Leaderlist] | Minimal graph signature for leader list algorithm |
G [Fixpoint] | Minimal graph signature for work list algorithm |
G [Strat] | Signature for graphs |
G [Minsep] | Minimal signature for computing the minimal separators |
G [Gml] | Signature for graph required by |
G [Dominator] | |
G [Prim] | |
G [Kruskal] | Minimal graph signature for Kruskal. |
G [Topological] | Minimal graph signature to provide. |
G [Coloring] | Minimal graph signature for |
G [Traverse] | Minimal graph signature for |
G [Path] | Minimal graph signature for Dijkstra's algorithm. |
G [Components] | Minimal graph signature required by |
G [Sig] | Common signature for all graphs. |
GM [Coloring] | Minimal graph signature for |
GM [Traverse] | Minimal graph signature for graph traversal with marking. |
G_FORD_FULKERSON [Flow] | Minimal digraph signature for Ford-Fulkerson. |
G_GOLDBERG_TARJAN [Flow] | Minimal graph signature for Goldberg-Tarjan. |
GraphWithDotAttrs [Graphviz] | Graph module with dot attributes |
H | |
HASHABLE [Sig] | Signature equivalent to |
I | |
I [Dominator] | |
I [Sig] | Signature for imperative (i.e. |
IM [Sig] | Signature for imperative graphs with marks on vertices. |
INT [Builder] | |
M | |
MARK [Sig] | Signature for marks on vertices. |
MINSEP [Minsep] | |
O | |
ORDERED_TYPE [Sig] | Signature equivalent to |
ORDERED_TYPE_DFT [Sig] | Signature equivalent to |
P | |
P [Sig] | Signature for persistent (i.e. |
PLAYER [Strat] | Signature for graph add-ons: an initial vertex, final vertices and membership of vertices to either true or false, i.e. |
S | |
S [Merge] | |
S [Dominator] | |
S [Oper] | |
S [Rand] | |
S [Rand.Planar] | |
S [Classic] | |
S [Builder] | |
S [Imperative] | Signature of imperative graphs. |
S [Imperative.Matrix] | |
S [Persistent] | Signature of persistent graphs. |
S [Sig_pack] | Signature gathering an imperative graph signature and all algorithms. |
STRAT [Strat] | Signature for strategies: for a given state, the strategy tells which state to go to |
T | |
Triangulation [Delaunay] | The result of triangulation is an abstract value of type |
U | |
U [Components] | |
UNIONFIND [Kruskal] | Signature of union-find. |
V | |
VERTEX [Sig] | Signature for vertices. |
V_DST [Gmap] | Signature for the destination graph. |
V_SRC [Gmap] | Signature for the source graph. |
W | |
WEIGHT [Sig] | Signature for edges' weights. |
WJ [Path] | Weight signature for Johnson's algorithm. |