Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some...
20 KB (2,447 words) - 12:33, 25 May 2025
deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited...
15 KB (2,548 words) - 08:32, 9 March 2025
depth-first search avoids the latter drawback at the price of exploring the tree's top parts over and over again. On the other hand, both depth-first...
14 KB (1,856 words) - 16:26, 25 May 2025
Second, the computer traverses F using a chosen algorithm, such as a depth-first search, coloring the path red. During the traversal, whenever a red edge...
19 KB (2,447 words) - 11:38, 22 April 2025
Tree traversal (redirect from Tree search algorithm)
possible, such as depth-limited searches like iterative deepening depth-first search. The latter, as well as breadth-first search, can also be used to...
26 KB (2,894 words) - 19:29, 14 May 2025
Topological sorting (section Depth-first search)
is based on depth-first search. The algorithm loops through each node of the graph, in an arbitrary order, initiating a depth-first search that terminates...
23 KB (3,170 words) - 01:52, 12 February 2025
processed in specific ways to increase efficiency. Breadth-first search (BFS) and depth-first search (DFS) are two closely-related approaches that are used...
16 KB (1,763 words) - 02:32, 14 October 2024
Recursion (computer science) (redirect from Depth of recursion)
linear search, or computing the factorial function, while standard examples of multiple recursion include tree traversal, such as in a depth-first search. Single...
62 KB (7,388 words) - 14:45, 29 March 2025
idea is to run a depth-first search while maintaining the following information: the depth of each vertex in the depth-first-search tree (once it gets...
12 KB (1,389 words) - 03:15, 8 July 2024
angle Breadth-first search Depth-first search Dijkstra's algorithm – Algorithm for finding shortest paths "A*-like" means the algorithm searches by extending...
43 KB (5,547 words) - 08:04, 27 May 2025
the algorithm is this: a depth-first search (DFS) begins from an arbitrary start node (and subsequent depth-first searches are conducted on any nodes...
13 KB (1,711 words) - 18:30, 21 January 2025
breadth-first search in place of depth-first search. Again, each node is given the opposite color to its parent in the search forest, in breadth-first order...
33 KB (4,093 words) - 00:09, 21 October 2024
node of a graph. Graph traversal algorithms, like breadth-first search and depth-first search, are analyzed using the von Neumann model, which assumes...
9 KB (1,558 words) - 19:55, 12 October 2024
Graph traversal (redirect from Graph search algorithm)
on the algorithm) have already been visited. Both the depth-first and breadth-first graph searches are adaptations of tree-based algorithms, distinguished...
11 KB (1,492 words) - 19:56, 12 October 2024
method: compute a depth first search tree, and test whether this tree's depth is greater than 2 d {\displaystyle 2^{d}} . If so, the tree-depth of the graph...
21 KB (2,817 words) - 08:49, 16 July 2024
on depth-first search compute strongly connected components in linear time. Kosaraju's algorithm uses two passes of depth-first search. The first, in...
13 KB (1,639 words) - 04:26, 19 May 2025
as a depth-first search tree or a breadth-first search tree according to the graph exploration algorithm used to construct it. Depth-first search trees...
26 KB (3,280 words) - 19:26, 11 April 2025
may be constructed in time O(mn) by using either breadth-first search or depth-first search to test reachability from each vertex. Alternatively, it can...
45 KB (5,646 words) - 20:41, 12 May 2025
the exhaustive methods such as depth-first search and breadth-first search, as well as various heuristic-based search tree pruning methods such as backtracking...
11 KB (1,453 words) - 16:18, 10 February 2025
following steps: Perform a depth-first search of the graph. Let d {\displaystyle d} be the height of the resulting depth-first search tree. Use the sequence...
22 KB (2,662 words) - 06:47, 12 May 2025
following examples as informed search algorithms: Informed/Heuristic depth-first search Greedy best-first search A* search State space State-space planning...
4 KB (488 words) - 07:05, 18 May 2025
Dijkstra's algorithm (redirect from Uniform-cost search)
two given nodes, a path finding algorithm on the new graph, such as depth-first search would work. A min-priority queue is an abstract data type that provides...
45 KB (5,637 words) - 14:13, 14 May 2025
depth-first search based algorithm. CARINE's main search algorithm is semi-linear resolution (SLR) which is based on an iteratively-deepening depth-first...
8 KB (1,160 words) - 08:48, 9 March 2025
binary search, sliding windows, linked lists, trees, tries, backtracking, heaps, priority queues, graphs, breadth-first search, depth-first search, dynamic...
10 KB (977 words) - 01:42, 25 May 2025
graph G {\displaystyle G} is a type of spanning tree, generalizing depth-first search trees. They are defined by the property that every edge of G {\displaystyle...
17 KB (2,302 words) - 07:42, 20 April 2025
uninformed search algorithms such as e.g. breadth-first search, depth-first search or iterative deepening. In 1992, B. Brügmann employed it for the first time...
39 KB (4,658 words) - 04:19, 5 May 2025
in the 19th century, has been used about a hundred years later as depth-first search. Dead-end filling is an algorithm for solving mazes that fills all...
20 KB (2,893 words) - 20:33, 16 April 2025
finite graph, include depth-first search trees and breadth-first search trees. Generalizing the existence of depth-first-search trees, every connected...
27 KB (3,383 words) - 16:48, 14 March 2025
problem that requires O(n) extra space using typical algorithms such as depth-first search (a visited bit for each node). This in turn yields in-place algorithms...
8 KB (1,151 words) - 04:17, 22 May 2025
trivial. There are well-known classical algorithms such as depth-first search and breadth-first search which solve USTCON in linear time and space. Their existence...
14 KB (1,793 words) - 15:43, 24 May 2024