The two least significant bytes encode the transparency information; the six most signification are the standard RGB color
information stored at each vertex
Trace of the algorithm as a list of markers Clique vertices
dom x y returns true iff x dominates y
dom x y
x
y
function from x to a list of nodes not dominated by x, but with predecessors which are dominated by x
function from x to a list of nodes immediately dominated by x
function from node to a list of nodes that dominate it.
Edge of the graph.
type of edges of the underlying graph
Attributes of edges.
Type for graph edges.
The type of the elements of a weak topological ordering over a set of 'a.
'a
type of the underlying graph
Attributes of graphs.
Type of graphs.
function from n to n's immediate dominator
n
idoms x y is true when x is y's immediate dominator
idoms x y
(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.
Type of labels on edges.
the abstract data type of a path checker; this is a mutable data structure
sdom x y returns true iff x strictly dominates y.
sdom x y
Attributes of (optional) boxes around vertices.
Subgraphs have a name and some vertices.
Information stored at each vertex.
The type of a sequence of outermost elements in a weak topological ordering.
type of graphs
Type of edges.
abstract type of graphs
Type of edges' weights.
Abstract type of graphs
type of vertices of the underlying graph
Attributes of vertices.
Attributes of nodes.
type of vertices
Type of graph vertices.
How to determine which vertices are to be considered as widening points.