Scribd
Upload
42 views

Ingles Presentacion

Breadth First Search (BFS) is a strategy that expands the root node of a tree first, then all its successors, followed by their successors, before exploring nodes at deeper levels. It uses a queue (FIFO) to store nodes at each level, expanding nodes at the front of the queue and adding their successors to the end, ensuring more shallow nodes are explored first. BFS is implemented by locating a starting point and goal, then exploring the graph level-by-level until the goal is found.

Uploaded by

Henry Yrry Bravo Sanchez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODP, PDF, TXT or read online on Scribd
42 views

Ingles Presentacion

Breadth First Search (BFS) is a strategy that expands the root node of a tree first, then all its successors, followed by their successors, before exploring nodes at deeper levels. It uses a queue (FIFO) to store nodes at each level, expanding nodes at the front of the queue and adding their successors to the end, ensuring more shallow nodes are explored first. BFS is implemented by locating a starting point and goal, then exploring the graph level-by-level until the goal is found.

Uploaded by

Henry Yrry Bravo Sanchez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODP, PDF, TXT or read online on Scribd
You are on page 1/ 19

Breadth First Search

(BFS)

Definition

BFS is a simple strategy in which expands first


the root node, then expands all the successors
of the root node, the their successors, etc.
Expand all the nodes to a depth in the search
tree before you expand any node in the next
level.

Implementation

Locate:

The starting point

A goal to achieve

BFS can be deployed with the search for trees


a border that is a empty queue(FIFO). The
FIFO queue puts all the new successors
generated at the end of the queue, which
means that the more superficial nodes are
expanded before the deeper nodes.

Example:

Explore the graph by the algorithm BFS

We introduce the first node in the


queue

We define the levels to explore

We put the first child of the parent


node

Second node child...

Third node child..

Next Level...

Next root node...

Finally...

You might also like