Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A search algorithm which considers neighbors of a vertex, that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue. (references) |
Source: compiled by the editor from various references; see credits. | |
(From Wikipedia, the free Encyclopedia)
Breadth-first search (BFS) is a tree search algorithm used for traversing or searching a tree (graph theory) or tree structure. Intuitively, you start at the root node and explore all the neighboring nodes. Then for each of those nearest nodes, explore their unexplored neighbor nodes, and so on until it finds the goal.
Formally, BFS is an uninformed search method that aims to expand and examine all nodes of a tree systematically in search of a solution. In other words, it exhaustively searches the entire tree without considering the goal until it finds it. It does not use a heuristic.
From the standpoint of the algorithm, all nodes obtained by expanding any node are placed at the end of the search queue. In typical implementations, nodes that have not yet been examined for their neighbors are placed in some container (such as a queue or linked list) called "open" and then once examined are placed in the container "closed".
When searching in a unweighted cyclic graph (one that is not a tree) for a shortest path, BFS may be adapted by keeping a bit on each node to indicate that it has already been visited.
Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Breadth-first search."
Crosswords: BREADTH-FIRST SEARCH |
| Specialty definitions using "BREADTH-FIRST SEARCH": level-order traversal. (references) |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-a-b-c-d-e-e-f-h-h-i-r-r-r-s-s-t-t" | |
-5 letters: hairsbreadths. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)42 52 45 41 44 54 48 2D 46 49 52 53 54 53 45 41 52 43 48 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000010 01010010 01000101 01000001 01000100 01010100 01001000 00101101 01000110 01001001 01010010 01010011 01010100 00100000 01010011 01000101 01000001 01010010 01000011 01001000 |
HTML Code (1990) (references)B R E A D T H - F I R S T   S E A R C H |
ISO 10646 (1991-1993) (references)0042 0052 0045 0041 0044 0054 0048 002D 0046 0049 0052 0053 0054 0053 0045 0041 0052 0043 0048 |
Encryption (beginner's substitution cypher): (references)365239353854421540435253542533935523742 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
