# AI News, Artificial Intelligence/Search/Exhaustive search/Breadth-first search

Breadth-first search (BFS) technique is a systematic search strategy which begins at an initial node (an initial state) and from the initial node search actions are applied downward on a tree structure in a breadth-wise order.

In the car key example, the BFS search order follows node sequence: 1, 2, 3, 4, 5… and so on in breadth-first order.

The search algorithm involves the repeated testing and removing of the first node from the front of the list, and then finding and appending the node’s successors to the list.

Comparing BFS to depth-first search algorithm, BFS does not suffer from any potential infinite loop problem , which may cause the computer to crash whereas depth first search goes deep down searching.

This is one of the important Graph traversal technique. BFS is based on Queue data structure. Analysis: The time complexity of BFS using Adjacency list is O(V + ...

Depth First Search Algorithm

This is one of the important Graph traversal technique. DFS is based on stack data structure. Analysis: The time complexity of DFS using Adjacency list is O(V + ...

4. Search: Depth-First, Hill Climbing, Beam

MIT 6.034 Artificial Intelligence, Fall 2010 View the complete course: Instructor: Patrick Winston This lecture covers algorithms for ..

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: Instructor: Erik Demaine License: Creative Commons ..

Search - DFS and BFS

Artificial Intelligence by Prof. Deepak Khemani,Department of Computer Science and Engineering,IIT Madras.For more details on NPTEL visit

Depth-first Search (DFS) on Graphs Part 1 - Algorithm

This video tutorial shows how the depth-first search (DFS) algorithm can be used to traverse a graph, using various examples of directed and undirected graphs.

10 2 Breadth First Search BFS The Basics 14 min

Lecture - 5 Informed Search

Lecture Series on Artificial Intelligence by Prof.Sudeshna Sarkar and Prof.Anupam Basu, Department of Computer Science and Engineering,I.I.T, Kharagpur .

Tabu Search

Artificial Intelligence by Prof. Deepak Khemani,Department of Computer Science and Engineering,IIT Madras.For more details on NPTEL visit

Lecture - 6 Problem Reduction Search: AND/OR Graphs

Lecture Series on Artificial Intelligence by Prof. P. Dasgupta, Department of Computer Science & Engineering, I.I.T,kharagpur. For More details on NPTEL visit ...