Uninformed Search - Bidirectional Search

Uninformed search, Bidirectional search, Forward Search, Backward search

[@bhim443]

very detailed and good explanation - thank you

[@haganlife]

Unweighted BFS is guaranteed to find shortest path at each level. Therefore it is NOT necessary to store previous nodes in memory. At each level just replace the previous queue with next queue.

[@hibasalman8462]

Thank you :)

[@SuperWhatusername]

Wonderful explanation, Thanks !!!

[@olashoretijesunimi6039]

Thanks so much for this video. Well delivered!!!

[@anjalichoudhary5467]

Thanks this was helpful :)