Voer een woord of zin in in een taal naar keuze 👆
Taal:
Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT
Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:
- hoe het woord wordt gebruikt
- gebruiksfrequentie
- het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
- opties voor woordvertaling
- Gebruiksvoorbeelden (meerdere zinnen met vertaling)
- etymologie
Wat (wie) is depth-first search - definitie
SEARCH ALGORITHM
Depth first search; Depth-first; DFS algorithm; Depth-first traversal; Depth-First Search; Back edge; Forward edge; Depth First Search; Applications of depth-first search
depth-first search
<algorithm> 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)
Depth-first search
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 arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
breadth-first search
![BFS on [[Maze-solving algorithm]]](https://commons.wikimedia.org/wiki/Special:FilePath/BFS-Algorithm Search Way.gif?width=200 "BFS on [[Maze-solving algorithm]]")
![Top part of [[Tic-tac-toe]] game tree](https://commons.wikimedia.org/wiki/Special:FilePath/Tic-tac-toe-game-tree.svg?width=200 "Top part of [[Tic-tac-toe]] game tree")
ALGORITHM FOR SEARCHING THE NODES OF A GRAPH IN ORDER BY THEIR HOP COUNT FROM A STARTING NODE
Breadth first search; Breadth first recursion; Breadth-first traversal; BFS algorithm; Breadth-first; Breath first search; Breath-first search; Breadth-First Search; Applications of breadth-first search
<algorithm> A graph search algorithm which tries all
one-step extensions of current paths before trying larger
extensions. This requires all current paths to be kept in
memory simultaneously, or at least their end points.
Opposite of depth-first search. See also {best first
search}.
(1996-01-05)
Wikipedia
Depth-first search
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 arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.
A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.
