its simple , in Iterative Deepening DFS , first dfs happens by setting limit of depth=0, then limit of depth = 1; and then 2 and so on...... point of doing that is we visit all the nodes at depth = k before visiting depth = k+1 suppose goal is at depth = d then we will not visit nodes which are at depth>d. so time complexity will reduce from b^m to b^d(i.e same as bfs) and also because we are doing dfs, we don't need to store all nodes and thats why space complexiy will also be low i.e bd(not bm as normal dfs because we are finding goal at depth d , and we will not visit nodes of depth>d)
This is getting heavy now, 😛
its simple , in Iterative Deepening DFS , first dfs happens by setting limit of depth=0, then limit of depth = 1; and then 2 and so on......
point of doing that is we visit all the nodes at depth = k before visiting depth = k+1
suppose goal is at depth = d then we will not visit nodes which are at depth>d.
so time complexity will reduce from b^m to b^d(i.e same as bfs)
and also because we are doing dfs, we don't need to store all nodes and thats why space complexiy will also be low i.e bd(not bm as normal dfs because we are finding goal at depth d , and we will not visit nodes of depth>d)
@@Aditya-ot7ib what is k and d here
fully done
done and dusted
Sir is Uniformed search or uninformed search?
women🍵🍵🍵
Uninformed
Women 🍵🍵🍵🍵🍵🍵🍵🍵🍵🍵🍵
Women🍵🍵🍵🍵🍵🍵🍵🍵🍵🍵🍵
Uniformed means all dfs and bfs
✌✌✌✌✌
Achay Mausam mai Sir Mausam ka acha lecture