- traversals
- Обходы
Большой англо-русский и русско-английский словарь. 2001.
traversals
Смотреть что такое "traversals" в других словарях:
traversals — n. crossing, passage … English contemporary dictionary
Microbeam — A microbeam is a narrow beam of radiation, of micrometer or sub micrometer dimensions. Together with integrated imaging techniques, microbeams allow precisely defined quantities of damage to be introduced at precisely defined locations. Thus, the … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… … Wikipedia
Stack (data structure) — In computer science, a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO) . Stacks are used extensively at every level of a modern computer system. For example, a modern PC uses stacks at the… … Wikipedia
Collection (computing) — In computer science, a collection is a grouping of some variable number of data items (possibly zero) that have some shared significance to the problem being solved and need to be operated upon together in some controlled fashion. Generally, the… … Wikipedia
Jet stream — Jet streams are fast flowing, relatively narrow air currents found at the tropopause, the transition between the troposphere (where temperature decreases with height) and the stratosphere (where temperature increases with height), [United States… … Wikipedia
Scottish Highlands — The Scottish Highlands (Scottish Gaelic: A Ghàidhealtachd , Scots: Hielans ) include the rugged and mountainous regions of Scotland north and west of the Highland Boundary Fault, although the exact boundaries are not clearly defined, particularly … Wikipedia
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
