Iterative Deepening Depth First Search / IDDFS in artificial intelligence using python

Link to BFS:- https://youtu.be/_1NvYX3zj6o
Today we are going to implement the Iterative Deepening Depth First Search / Iterative Deepening DFS / IDDFS in artificial intelligence using python
IDDFS is an hybrid algorithm which combines the DFS(Depth First Search) and BFS(Breadth First Search).

⌛ TIME-STAMPS ⏳
Introduction and explanation of problem: (00:00)
Solution and explanation: (04:27)
Outro and final remarks: (11:01)
⌛ TIME-STAMPS ⏳

IDDFS(Iterative Deepening Depth First Search) has some advantages over normal BFS and DFS algorithms:-
1.If a graph has infinite depth IDDFS will not go into infinite depth and it'll improve the time complexity as compared to DFS
2.It improves the space complexity problem of BFS because it doesn't always store all the nodes of the current level like BFS

This question may be asked in different ways but the basic algorithm and implementation remains the same.


IMPLEMENTATION OF IDDFS:-
https://github.com/kjammes/ArtificialIntelligence/blob/master/IDDFS.py

Code for all videos in current playlist
https://github.com/kjammes/ArtificialIntelligence
.
Today I'm using IDDFS to traverse a graph and check whether or not we can reach a specific node in a graph.
We'll begin looking from the starting node and go all the way down to the last node of last level(last level will be given as input).
This is one of the algorithms used in Artificial Intelligence.
.
.
.
Link to my channel:- https://www.youtube.com/channel/UCBx3lI4R6bRGJhbiu4A_uCA?view_as=subscriber
.
.
.
.
.
You can follow me on Instagram:-
https://www.instagram.com/jayesh_karli/
You can follow me on Twitter:-
https://twitter.com/JayeshKarli
My Facebook page:-
https://www.facebook.com/Jay-Karli-jcoder-104548271359635/