Index of types
A
arrow_style
[
Graphviz
]
attr
[
Dot_ast
]
C
color
[
Graphviz
]
compass_pt
[
Dot_ast
]
D
data
[
Cliquetree.CliqueTree.CliqueTreeV
]
Trace of the algorithm as a list of markers Clique vertices
data
[
Util.DataV
]
E
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.G
]
edge_label
[
Rand.S
]
edgelist
[
Mcs_m.MaximalCardinalitySearch.I
]
edgelist
[
Mcs_m.MaximalCardinalitySearch.P
]
edgeset
[
Md.I
]
edgeset
[
Md.P
]
elt
[
Kruskal.UNIONFIND
]
F
file
[
Dot_ast
]
G
g
[
Oper.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.
I
id
[
Dot_ast
]
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
[
Cliquetree.CliqueTree.CliqueTreeV
]
label
[
Gml.G.E
]
label
[
Gml.G.V
]
label
[
Flow.G_FORD_FULKERSON.E
]
label
[
Flow.FLOW
]
Type of labels on edges.
label
[
Kruskal.G.E
]
label
[
Path.WEIGHT
]
Type for labels of graph edges.
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
]
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
]
S
stmt
[
Dot_ast
]
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
[
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
[
Flow.G_FORD_FULKERSON.E
]
t
[
Flow.G_FORD_FULKERSON
]
t
[
Flow.G_GOLDBERG
]
t
[
Flow.FLOW
]
Type of edges.
t
[
Kruskal.UNIONFIND
]
t
[
Kruskal.G.E
]
t
[
Kruskal.G
]
t
[
Components.G
]
t
[
Topological.G
]
t
[
Coloring.GM
]
t
[
Coloring.G
]
t
[
Traverse.GM.V
]
t
[
Traverse.GM
]
t
[
Traverse.G
]
t
[
Path.WEIGHT
]
Type of edges' weights.
t
[
Path.G.E
]
t
[
Path.G
]
t
[
Util.DataV
]
t
[
Sig_pack.S.E
]
t
[
Sig_pack.S.V
]
t
[
Sig_pack.S
]
abstract type of graphs
t
[
Sig.COMPARABLE
]
t
[
Sig.HASHABLE
]
t
[
Sig.ORDERED_TYPE
]
t
[
Sig.ANY_TYPE
]
t
[
Sig.G
]
Abstract type of graphs
t
[
Sig.EDGE
]
t
[
Sig.VERTEX
]
triangulation
[
Delaunay.Triangulation
]
V
value
[
Gml
]
value_list
[
Gml
]
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
[
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
]