Term
|
Definition
| a graph such that a large fraction of possible connections among nodes are present, i.e. the number of edges is of the order of the number of vertices squared. cf. sparse graph. |
|
|
Term
|
Definition
| the number of links between the root of a tree and the leaves. |
|
|
Term
|
Definition
| a search in which children of a node are considered (recursively) before siblings are considered. |
|
|
Term
|
Definition
| to convert from a pointer (address) to the data that is pointed to. |
|
|
Term
|
Definition
| all nodes below a given node in a tree. |
|
|
Term
|
Definition
| a pattern that describes a set of similar programs. |
|
|
Term
|
Definition
| describes a function that modifies its arguments. |
|
|
Term
|
Definition
|
|
Term
|
Definition
| an optimal greedy algorithm to find the minimum distance and shortest path in a weighted graph from a give start node. |
|
|
Term
|
Definition
| describes an arc that can only be traversed in one direction, or a graph with such arcs. |
|
|
Term
|
Definition
| a directed graph with no cycles. Every tree is a DAG, but a DAG may be more general. |
|
|
Term
| discrete event simulation |
|
Definition
| a simulation in terms of events, in which the highest-priority (least time) event is removed from an event queue and executed, which may have the effect of scheduling future events. |
|
|
Term
|
Definition
| a problem-solving strategy in which a problem is broken down into sub-problems, until simple subproblems are reached. |
|
|
Term
|
Definition
| the set of values that are the source values of a mapping. |
|
|
Term
|
Definition
| a linked list in which each element has both forward and backward pointers. |
|
|
Term
|
Definition
| a link or arc between nodes in a graph. |
|
|
Term
|
Definition
| a binary Boolean function whose output is 1 if its inputs are different. Abbreviated XOR |
|
|
Term
|
Definition
| another term for hashing with buckets. |
|
|
Term
|
Definition
| a sort using external storage in addition to main memory. |
|
|
Term
|
Definition
| describes a process in which every arriving customer will eventually be served. |
|
|
