Breadth-first search
id:
breadth-first-search-232-1330342
title:
Breadth-first search
text:
Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered but not yet explored. For example, in a chess endgame, a chess engine may build the game tree from the current position by applying all possible moves an
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm to search the nodes of a graph
original url:
https://en.wikipedia.org/wiki/Breadth-first_search
date created:
2002-09-30T19:31:03Z
date modified:
2024-09-15T23:26:04Z
main entity:
{"identifier":"Q325904","url":"https://www.wikidata.org/entity/Q325904"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/46/Animated_BFS.gif","width":187,"height":175}
fields total:
13
integrity:
16