Iterative Deepening Depth First Search (IDDFS)

Posted on January 14, 2018July 21, 2019

Hello people! In this post we will talk about another search algorithm Iterative deepening depth first search (IDDFS) or Iterative deepening search (IDS). This algorithm is used when you have a goal directed agent in an infinite search space (or search tree). Why do Breadth First Search (BFS) and Depth First Search (DFS) fail in […]

Graph Theory

Depth First Search Algorithm

Posted on December 26, 2014February 25, 2017

Hello people…! In this post I will talk about the other Graph Search Algorithm, the Depth First Search Algorithm. Depth First Search is different by nature from Breadth First Search. As the name suggests, “Depth”, we pick up a vertex S and see all the other vertices that can possibly reached by that vertex S and […]

Theory of Programming

Tag: Depth First Search

Iterative Deepening Depth First Search (IDDFS)

Depth First Search Algorithm