Term
|
Definition
| a heuristic search algorithm that attempts to find a desired goal using a heuristic function to estimate the distance from a given node to the goal. |
|
|
Term
|
Definition
| a description of operations on a data type that could have multiple possible implementations. |
|
|
Term
|
Definition
| describes a graph with no cycles (circular paths). |
|
|
Term
|
Definition
| a representation of a graph in which each node has a list of nodes that are adjacent to it, i.e. connected to it by an arc. |
|
|
Term
|
Definition
| a representation of a graph in which a boolean matrix contains a 1 at position (i,j) iff there is an arc from node i to node j. |
|
|
Term
|
Definition
| in a tree, the union of a node's parent and the parent's ancestors. |
|
|
Term
|
Definition
| a link between two nodes in a graph. |
|
|
Term
|
Definition
| A contiguous block of memory containing elements of the same type, accessed by numeric index. |
|
|
Term
|
Definition
| a list of pairs, where each pair has a key and a value associated with the key. |
|
|
Term
|
Definition
| a self-balancing sorted binary tree, in which the heights of subtrees differ by at most 1. |
|
|
Term
|
Definition
| a tree with a high branching factor, to minimize the number of disk accesses required to access a desired record. |
|
|
Term
|
Definition
| in a tree search, to move back from the node currently being examined to its parent. |
|
|
Term
|
Definition
| a tree in which the heights of subtrees are approximately equal. |
|
|
Term
|
Definition
| information transfer rate of a network connection, in bits/second. |
|
|
Term
|
Definition
| a simple case that can be solved easily, without recursion. |
|
|
Term
|
Definition
| an abstracted function that describes the amount of computer time or memory space required by an algorithm, as a function of problem size. For problems larger than a certain size, the actual time or space required will be less than the Big O multiplied by some constant. |
|
|
Term
|
Definition
| describes a relation that is both injective and surjective (one-to-one and onto). |
|
|
Term
|
Definition
| a data structure that implements a complete binary tree within an array, such that every parent node has a value that is less than the value of either of its children. |
|
|
Term
|
Definition
| a tree in which each node has at most two children. |
|
|
Term
|
Definition
| search of a binary tree or other structure, in which the size of the set to be searched is cut in half at each step. |
|
|
