Oct 1, 2019 in Artificial Intelligence
Q: What is a breadth-first search algorithm?

1 Answer

0 votes
Oct 2, 2019

A breadth-first search (BFS) algorithm, used for searching tree or graph data structures, starts from the root node, then proceeds through neighboring nodes, and further moves toward the next level of nodes. Till the arrangement is found, it produces one tree at any given moment. As this pursuit can be executed utilizing the FIFO (first-in, first-out) data structure, this strategy gives the shortest path to the solution.

Click here to read more about Artificial Intelligence
Click here to read more about Insurance

Related questions