Term
|
Definition
| being close together in time, i.e. memory accesses that occur within a short time of each other. |
|
|
Term
|
Definition
| a linear ordering of nodes of an acyclic graph, such that a node follows all of its graph predecessors in the ordering. |
|
|
Term
|
Definition
| changing the links in a binary tree to change the relative heights of the child subtrees, while leaving the sort order of the tree unchanged. |
|
|
Term
|
Definition
| describes a graph in which the arcs may be followed in either direction. |
|
|
Term
|
Definition
| given two sets, the union is the set of elements that are members of either set. |
|
|
Term
|
Definition
| converting an abstract syntax tree into a sentence in a language, such as a programming language. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| a number that denotes the cost of following an arc in a graph. |
|
|
Term
|
Definition
| an ordering that can be guaranteed to terminate, e.g. starting at a positive integer and counting down to 0. |
|
|
Term
|
Definition
| Extensible Markup Language, a way of writing data in a tree-structured form by enclosing it in tags. |
|
|
Term
|
Definition
|
|
