Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Computing | Depth-first search A graph search algorithm which extends the current path as far as possible before backtracking to the last choice point and trying the next alternative path. Depth-first search may fail to find a solution if it enters a cycle in the graph. This can be avoided if we never extend a path to a node which it already contains. Opposite of breadth first search. See also iterative deepening. (1995-04-19). Source: The Free On-line Dictionary of Computing. |
Math | (1) Any search algorithm which considers outgoing edges of a vertex before any neighbors of the vertex, that is, outgoing edges of the vertex's predecessor in the search. Extremes are searched first. This is easily implemented with recursion. (2) An algorithm which marks all vertices in a directed graph in the order they are discovered and finished, partitioning the graph into a forest. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: DEPTH-FIRST SEARCH |
| Specialty definitions using "DEPTH-FIRST SEARCH": backtracking, breadth first search ♦ depth-first backward reasoning, DFS, DFS forest ♦ iterative deepening. (references) |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-c-d-e-e-f-h-h-i-p-r-r-s-s-t-t" | |
-4 letters: archerfishes. | |
-5 letters: archpriests, dispatchers, heptarchies, heresiarchs, paresthetic, readerships, researchist, spearfished, stepfathers, stripteaser, tetrarchies. | |
| 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)44 45 50 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)01000100 01000101 01010000 01010100 01001000 00101101 01000110 01001001 01010010 01010011 01010100 00100000 01010011 01000101 01000001 01010010 01000011 01001000 |
HTML Code (1990) (references)D E P T H - F I R S T   S E A R C H |
ISO 10646 (1991-1993) (references)0044 0045 0050 0054 0048 002D 0046 0049 0052 0053 0054 0053 0045 0041 0052 0043 0048 |
Encryption (beginner's substitution cypher): (references)38395054421540435253542533935523742 |
| 1. Crosswords 2. Anagrams 3. Orthography 4. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
