Index of types

A
align [XDotDraw]	Text alignment
arrow_style [Graphviz]
attr [Dot_ast]
B
bounding_box [XDot]	upper-left and bottom-right corners
C
cluster [DGraphContainer]
cluster [DGraphView.S]
cluster [DGraphTreeModel.S]
cluster [DGraphTreeLayout]
cluster [DGraphModel.Make]
cluster [DGraphModel]
cluster_layout [XDot]
clusters_hash [Dot]
color [Graphviz]
color_with_transparency [Graphviz]	The two least significant bytes encode the transparency information; the six most signification are the standard RGB color
compass_pt [Dot_ast]
D
data [Fixpoint.Analysis]	information stored at each vertex
data [Cliquetree.CliqueTree.CliqueTreeV]	Trace of the algorithm as a list of markers Clique vertices
data [Util.DataV]
direction [Fixpoint]
dom [Dominator.S]	`dom x y` returns true iff `x` dominates `y`
dom_frontier [Dominator.S]	function from `x` to a list of nodes not dominated by `x`, but with predecessors which are dominated by `x`
dom_functions [Dominator.Make_graph]
dom_graph [Dominator.Make_graph]
dom_tree [Dominator.S]	function from `x` to a list of nodes immediately dominated by `x`
dominators [Dominator.S]	function from node to a list of nodes that dominate it.
dotg_model [DGraphModel]
draw_state [XDotDraw]
E
edge [DGraphContainer.S]
edge [DGraphView.S]
edge [ChaoticIteration.Data]	Edge of the graph.
edge [Merge.I]
edge [Merge.S]
edge [Contraction.G]
edge [Fixpoint.Analysis]	type of edges of the underlying graph
edge [Gmap.E_DST]
edge [Graphviz.ATTRIBUTES]	Attributes of edges.
edge [Graphviz.NeatoAttributes]	Attributes of edges.
edge [Graphviz.DotAttributes]	Attributes of edges.
edge [Graphviz.CommonAttributes]	Attributes of edges.
edge [Sig_pack.S]
edge [Sig.WEIGHT]	Type for graph edges.
edge [Sig.G]
edge_label [Merge.I]
edge_label [Merge.S]
edge_label [Rand.S]
edge_layout [XDot]
edgelist [Mcs_m.MaximalCardinalitySearch.I]
edgelist [Mcs_m.MaximalCardinalitySearch.P]
edgeset [Md.I]
edgeset [Md.P]
element [WeakTopological]	The type of the elements of a weak topological ordering over a set of `'a`.
elt [Kruskal.UNIONFIND]
F
file [Dot_ast]
G
g [Fixpoint.Analysis]	type of the underlying graph
g [Oper.S]
global_view [DGraphContainer.S]
graph [DGraphContainer.S]
graph [Merge.I]
graph [Merge.S]
graph [Graphviz.ATTRIBUTES]	Attributes of graphs.
graph [Graphviz.NeatoAttributes]	Attributes of graphs.
graph [Graphviz.DotAttributes]	Attributes of graphs.
graph [Graphviz.CommonAttributes]	Attributes of graphs.
graph [Rand.Planar.S]
graph [Rand.S]
graph [Classic.S]
graph [Sig_pack.S.Mark]
graph [Sig.MARK]	Type of graphs.
graph_layout [DGraphTreeModel.S]
graph_layout [XDot.Make]	Main layout type
H
height [XDotDraw]
I
id [Dot_ast]
idom [Dominator.S]	function from `n` to `n`'s immediate dominator
idoms [Dominator.S]	`idoms x y` is true when `x` is `y`'s immediate dominator
iterator [Traverse.Bfs]
iterator [Traverse.Dfs]	(h, st, g) where h is the set of marked vertices and st the stack invariant: the first element of st is not in h i.e.
L
label [DGraphSubTree.Tree.V]
label [DGraphSubTree.G.V]
label [Cliquetree.CliqueTree.CliqueTreeV]
label [Gml.G.E]
label [Gml.G.V]
label [Prim.G.E]
label [Flow.G_FORD_FULKERSON.E]
label [Flow.FLOW]	Type of labels on edges.
label [Kruskal.G.E]
label [Path.G.E]
label [Util.DataV]
label [Sig_pack.S.E]
label [Sig_pack.S.V]
label [Sig.EDGE]
label [Sig.VERTEX]
N
node [Dot_ast]
node_id [Dot_ast]
node_layout [XDot]	Each node has at least a position and a bounding box.
O
operation [XDotDraw]	Drawing operations
P
path_checker [Path.Check]	the abstract data type of a path checker; this is a mutable data structure
path_checker [Sig_pack.S.PathCheck]
point [Delaunay.CCC]
port [Dot_ast]
pos [XDot]	2D coordinates
pos [XDotDraw]	Dot layout coordinates
S
sdom [Dominator.S]	`sdom x y` returns true iff `x` strictly dominates `y`.
shape_p [DGraphViewItem]	Shape properties
size [XDotDraw]
status [DGraphContainer]
stmt [Dot_ast]
style_attr [XDotDraw]	Style attributes
subgraph [Graphviz.ATTRIBUTES]	Attributes of (optional) boxes around vertices.
subgraph [Graphviz.NeatoAttributes]	Subgraphs have a name and some vertices.
subgraph [Graphviz.DotAttributes]	Subgraphs have a name and some vertices.
subgraph [Dot_ast]
T
t [DGraphTreeModel.S.TreeManipulation]
t [DGraphSubTree.S]
t [DGraphSubTree.Tree.V]
t [DGraphSubTree.Tree]
t [DGraphSubTree.G.E]
t [DGraphSubTree.G.V]
t [DGraphSubTree.G]
t [ChaoticIteration.Data]	Information stored at each vertex.
t [ChaoticIteration.G.E]
t [ChaoticIteration.G]
t [WeakTopological.G]
t [WeakTopological]	The type of a sequence of outermost elements in a weak topological ordering.
t [Clique.G]
t [Mincut.G]
t [Graphml.G.E]
t [Graphml.G]
t [Contraction.G]
t [Leaderlist.G]
t [Fixpoint.G.E]
t [Fixpoint.G]
t [Strat.STRAT]
t [Strat.PLAYER]
t [Strat.G]
t [Cliquetree.CliqueTree.CliqueTreeE]
t [Cliquetree.CliqueTree.CliqueTreeV]
t [Cliquetree.CliqueTree.CliqueV]
t [Minsep.G]
t [Gmap.E_DST]
t [Gmap.E_SRC]
t [Gmap.V_DST]
t [Gmap.V_SRC]
t [Gml.G.E]
t [Gml.G.V]
t [Gml.G]
t [Dominator.G]
t [Dominator.S]	type of graphs
t [Prim.G.E]
t [Prim.G]
t [Flow.G_FORD_FULKERSON.E]
t [Flow.G_FORD_FULKERSON]
t [Flow.G_GOLDBERG_TARJAN]
t [Flow.FLOW]	Type of edges.
t [Kruskal.UNIONFIND]
t [Kruskal.G.E]
t [Kruskal.G]
t [Topological.G]
t [Coloring.GM]
t [Coloring.G]
t [Traverse.GM.V]
t [Traverse.GM]
t [Traverse.G]
t [Path.G.E]
t [Path.G]
t [Components.U]
t [Components.G]
t [Util.DataV]
t [Sig_pack.S.E]
t [Sig_pack.S.V]
t [Sig_pack.S]	abstract type of graphs
t [Sig.WEIGHT]	Type of edges' weights.
t [Sig.G]	Abstract type of graphs
t [Sig.EDGE]
t [Sig.VERTEX]
t [Sig.COMPARABLE]
t [Sig.HASHABLE]
t [Sig.ORDERED_TYPE]
t [Sig.ANY_TYPE]
tree_view [DGraphContainer.S]
triangulation [Delaunay.Triangulation]
V
value [Gml]
value_list [Gml]
vertex [DGraphContainer.S]
vertex [DGraphView.S]
vertex [Merge.I]
vertex [Merge.S]
vertex [Graphml.G]
vertex [Contraction.G]
vertex [Fixpoint.Analysis]	type of vertices of the underlying graph
vertex [Strat.STRAT]
vertex [Strat.PLAYER]
vertex [Strat.G]
vertex [Gmap.V_DST]
vertex [Graphviz.ATTRIBUTES]	Attributes of vertices.
vertex [Graphviz.NeatoAttributes]	Attributes of nodes.
vertex [Graphviz.DotAttributes]	Attributes of nodes.
vertex [Graphviz.CommonAttributes]	Attributes of vertices.
vertex [Dominator.S]	type of vertices
vertex [Rand.S]
vertex [Sig_pack.S.Mark]
vertex [Sig_pack.S.E]
vertex [Sig_pack.S]
vertex [Sig.MARK]	Type of graph vertices.
vertex [Sig.G]
vertex [Sig.EDGE]
W
widening_set [ChaoticIteration]	How to determine which vertices are to be considered as widening points.
width [XDotDraw]	Dimensions