Keywords

#breadth-first_search

Breadth-first search

Algorithm to search the nodes of a graph

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.

Mon 16th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Breadth-first search Lexicographic breadth-first search Depth-first search Tree traversal Parallel breadth-first search Graph (abstract data type) Iterative deepening depth-first search Graph traversal Dijkstra's algorithm A* search algorithm
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.