- breadth first search
- поиск в ширину (метод анализа структуры дерева, при котором каждый уровень полностью подвергается анализу до перехода к следующему уровню)
Большой англо-русский и русско-английский словарь. 2001.
breadth first search
Смотреть что такое "breadth first search" в других словарях:
Breadth-first search — Infobox Algorithm class=Search Algorithm Order in which the nodes are expanded data=Graph time=O(|V|+|E|) = O(b^d) space=O(|V|+|E|) = O(b^d) optimal=yes (for unweighted graphs) complete=yesIn graph theory, breadth first search (BFS) is a graph… … Wikipedia
Breadth First Search — Algorithme de parcours en largeur Pour les articles homonymes, voir BFS. L algorithme de parcours en largeur (ou BFS, pour Breadth First Search) permet le parcours d un graphe de manière itérative, en utilisant une file. Il peut par exemple… … Wikipédia en Français
breadth-first-search — paieška į plotį statusas T sritis informatika apibrėžtis ↑Paieškos medžio apėjimo būdas, kai išanalizavus visus to paties lygio mazgus pereinama prie kito lygio mazgų. atitikmenys: angl. breadth first search ryšiai: dar žiūrėk – paieškos medis… … Enciklopedinis kompiuterijos žodynas
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Beam search — is a heuristic search algorithm that is an optimization of best first search that reduces its memory requirement. Best first search is a graph search which orders all partial solutions (states) according to some heuristic which attempts to… … Wikipedia
Uniform-cost search — In computer science, uniform cost search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph. Intuitively, the search begins at the root node. The search continues by visiting the next node… … Wikipedia
First Roumanian-American congregation — First Roumanian American congregation … Wikipedia
Depth-limited search — Class Search Algorithm Data structure Graph Worst case performance O( | V | + | E | ) … Wikipedia
