00:00 Bidirectional search is a special technique where two simultaneous searches are conducted from initial to goal and backward from goal to initial. 01:14 Bidirectional search involves searching from both directions simultaneously. 02:20 Bidirectional search is more efficient than breadth first or depth first search 03:26 Optimizing time complexity of searching algorithm 04:28 Bidirectional search reduces time complexity compared to BFS and DFS. 05:40 Time complexity of BFS/DFS in worst case is O(b^d) 06:44 Depth first search algorithm explained with an analogy 07:40 Bidirectional search guarantees optimal solution and completeness with less time complexity compared to BFS and DFS
Sirji aapka video dekhnese pehle hi like button apne aap active laagbaagh sare log karte honge jinhone aapke 2-3hi video kyu na dekhe ho, aapki mahanat sarahniya hai 👍
Helo sir ..mein ny 2 saal bd ppsc test ki preparation krna start ki han aur apki videos bht helpful ho rhi han ..jo subject during study boring lgty thy smj ni aty thy bs ab wo b smj aa rhy han ..thank you From Pakistan ...you are the best teacher . Apko Pakistan mein hona chye tha
Very good content. I've watched your full playlist on DBMS and Computer Architecture and now this and liked each and every video. Thankyou! PS: Please make a video on Iterative Deepening DFS too :)
sir hamari poori class aaap k video lectures sunti hai aur paper ki last night aur hamari poori class apki fan hai q k... poora saal teachers k lectures hamein samaj nai aaty aur paper se eik din pehlay aapki video dekh k concepts clear hu jaty hain ...im from pakistan
My name is Shahid Khan from Pakistan kpk.sir I see your all video . I am very thankful to you because your method very easy to understand every student and sir please some video made in assembly language,softwar engineering .
Sir, I request you You also create a video on data structure and algorithms which includes sorting .bubble sort .selection sort. How merage sort works .Waiting for your video,
when we know the goal state what's the benefit to search for it again, even if we assume there are multiple goal states then how can u determine the initial goal state
Hello Varun! Thank you so much for your hard works. You really help me a lot. And one thing to mention here, I think the space complexity of bidirectional search is O(b^(d/2)). Can you please check? Thanks
Can someone explain, if we already know the goal why would we search? I mean the aim is to search the goal state and if you could initiate a reverse search from the goal state then what's the need of the search in the first place?
I hope sir you will answer my query Sir my humble request is that i have completed btech in computer science and engineering but now i wants to do masters in biotechnology.am i eligible to do msc or mtech in biotechnology. Does NTA conducts same exam for both mtech and msc biotechnology..
should the time complexity not be b^d as the worst possible case for it would be when both the searches don't meet at an point and will have to travel the entire path(considering multiple points of reaching the goal state exist.
Even if we start from the starting node then move one step forward (say down) and then we move one step upward from the goal state, we are effectively taking 2 steps? So it is not b^(d/2) it is essentially b^(d) unless we are doing parallel processing. Am I right??
did not get how it's always possible to meet in between - the bfs example They could still miss each other no??, unless the stop point is (is node previously visited by friend 2), but if stop point is (is friend 2 at node AT PRESENT), it's possible to miss no?
Sir if we are searching from start and from goal simultaneously then time complexity must be half as we are searching from both side at same time and meet at middle point and stop there ?? So time complexity should be b^(d/2) only na ??
00:00 Bidirectional search is a special technique where two simultaneous searches are conducted from initial to goal and backward from goal to initial.
01:14 Bidirectional search involves searching from both directions simultaneously.
02:20 Bidirectional search is more efficient than breadth first or depth first search
03:26 Optimizing time complexity of searching algorithm
04:28 Bidirectional search reduces time complexity compared to BFS and DFS.
05:40 Time complexity of BFS/DFS in worst case is O(b^d)
06:44 Depth first search algorithm explained with an analogy
07:40 Bidirectional search guarantees optimal solution and completeness with less time complexity compared to BFS and DFS
May God bless u respected sir
Your hardwork will give fruitful results to everyone poor students who r not able to pay fee for competitive exams.
Sirji aapka video dekhnese pehle hi like button apne aap active laagbaagh sare log karte honge jinhone aapke 2-3hi video kyu na dekhe ho, aapki mahanat sarahniya hai 👍
You are the saviour of corona batches sir . Thanks a lot . This AI playlist helped me a lot .
I can play whole semester because I know at last this man is going to pass me my exams on last day
THANK YOU SIR
ap ki wajha se aj phlye dfa mary exam ki preparation achy hoi.
WoW!🤩🤩 How beautifully you have explained with such amazing examples💯. Thank you so much ✨🙏
me always used BFS while searching my GF
😂😂😂
😂😂
🤣🤣🤣
You have a. Gf 😉😥
@@mimis.5139😜😜
You are superb men....Your teaching skills kamal h bro...Plz continue GATE series 🙏💗
Thank you...
allah apko salamat rakein sir lots of thanks from pakistan
Helo sir ..mein ny 2 saal bd ppsc test ki preparation krna start ki han aur apki videos bht helpful ho rhi han ..jo subject during study boring lgty thy smj ni aty thy bs ab wo b smj aa rhy han ..thank you
From Pakistan ...you are the best teacher .
Apko Pakistan mein hona chye tha
ho gya test clear?
I'm a working Student it's really helpful for me.Thanks for explaining sir.
the way Aliagents structures their AI agents is groundbreaking, can’t wait to see what’s next
thanks bro got my mid 1 well!
the aim was to find the Goal node, in this, we already know about the Goal node, then why perform the search?
It's like you know the school location and your home location but you want to find path...
Here you know goal also but searching for path
Awesome way to teach very easy to understand.Thank You Guru ji🙏
Very good content. I've watched your full playlist on DBMS and Computer Architecture and now this and liked each and every video. Thankyou!
PS: Please make a video on Iterative Deepening DFS too :)
Aapka hr EK video bahut easily understand hojata h sir..... thank you sir🙏🏼
excellent lecture, very clear and u made easy, Thank you....
Faculty's ko bhi aisa hi padhana chiye mam
Very nice person ☺️ and learn very easily ☺️
Ky behtareen tareeke se samjhaya hai aapne sr ❤
Easy explanation great sir👍💯
sir hamari poori class aaap k video lectures sunti hai aur paper ki last night aur hamari poori class apki fan hai q k... poora saal teachers k lectures hamein samaj nai aaty aur paper se eik din pehlay aapki video dekh k concepts clear hu jaty hain ...im from pakistan
Literally my 3hrs are being wasted every week in university! Your channel is legit
hii zehra
Sir time complexity for bidirectional search is =o(b^d ) given in book
Gurujee shandar jabardast zindabad
Your explanation so good
we bunk our lectures to watch your classes !!
My name is Shahid Khan from Pakistan kpk.sir I see your all video . I am very thankful to you because your method very easy to understand every student and sir please some video made in assembly language,softwar engineering .
Sir, I request you You also create a video on data structure and algorithms which includes sorting .bubble sort .selection sort. How merage sort works .Waiting for your video,
when we know the goal state what's the benefit to search for it again, even if we assume there are multiple goal states then how can u determine the initial goal state
to find intermediate states to reach final state
Aliagents is creating a powerful AI ecosystem, I’m excited to see how this develops
Awesome you are such a great teacher ☺️
Sir for each search it is b^d/2. BUT both the searches are operating simultaneously,, so why a constant 2 gets multiplied
Hello Varun! Thank you so much for your hard works. You really help me a lot. And one thing to mention here, I think the space complexity of bidirectional search is O(b^(d/2)). Can you please check? Thanks
ya, that's what i thought. i think it's a mistake in video.
Happy teachers day 🙏❤️ you are my teacher
Thank u so much Sir 😍😍😍
Ur videos are very helpful for us,,....
Keep uploading plz...
Big Love and respect from Pakistan❤❤❤
Bidirectional search is an example of mentos Zindagi.
Aagaya MST!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Amazing explanation sir.
Really,,,,this is the best...I like it...
Aliagents is pushing the limits of what’s possible with AI, the future looks promising for them
sir your explanation is very great...
amazing sir. really splendid examples
why time complexity is 2*(b^d/2),
if they start at the same time it should be b^d/2
Can someone explain, if we already know the goal why would we search? I mean the aim is to search the goal state and if you could initiate a reverse search from the goal state then what's the need of the search in the first place?
Thank u sir🤗🤗your explanation is too good😊😊thank u so much
So in this technique we have to already know the goal position....Then what are we searching for?
We always know goal position for these situations we are concerned with the optimal path here
I hope sir you will answer my query
Sir my humble request is that i have completed btech in computer science and engineering but now i wants to do masters in biotechnology.am i eligible to do msc or mtech in biotechnology.
Does NTA conducts same exam for both mtech and msc biotechnology..
Yes you can apply for GATE exam if you want to do Mtech in Biotechnology and there is IIT JAM exam for Msc in Biotechnology
following Aliagents closely, their work with tokenized AI agents is one to watch
It is possible sir, we use deapth first search from initial to gaol state and breath first search from goal to initial state
Where are video lectures of other logic and reasoning types?? Please make videos on them.
Excellent explanation sir keep it ❤️
Pass my university exam by watching your video
Os
Toc
Cd
Ai
DBMS
Bcs csit ? Nepali ?
Love you brother from Pakistan 🇵🇰
should the time complexity not be b^d as the worst possible case for it would be when both the searches don't meet at an point and will have to travel the entire path(considering multiple points of reaching the goal state exist.
if it is the worst case scenario
shouldn't time complexity be
b^d+b^d=2b^d??
We are going upto half depth in forward and half depth in backward..
just watch with 1.75x spedd to save time.
Even if we start from the starting node then move one step forward (say down) and then we move one step upward from the goal state, we are effectively taking 2 steps? So it is not b^(d/2) it is essentially b^(d) unless we are doing parallel processing. Am I right??
Great explaination
which camera you use for recording? nice lectures b/w
How to know where is the goal state? It again takes time to find goal state. Give clarity
same question in my mind if we know the goal state why we find goal state ..
@@AbdulHaseeb091 sometimes it is necessary to know which path is the best one , even if you know the destination.
Thanks a ton ! Sir❤❤❤❤❤❤
Thankyou, Sir!
What will be the Time Complexity if we using BFS ?
sir is 2(b^d) will be the time complexity for Bi-Directional DFS ...?
Plz tell me about progressive search
Thank you sir.
if u have already known goal in advance, what is the need of search??
Very nice ❤
Thank you sooo much
Legends are watching this series just one day before final exam 💀
Board exam ☠️
did not get how it's always possible to meet in between - the bfs example
They could still miss each other no??, unless the stop point is (is node previously visited by friend 2), but if stop point is (is friend 2 at node AT PRESENT), it's possible to miss no?
Thanku guru ji
thankyou sir
Sir if we are searching from start and from goal simultaneously then time complexity must be half as we are searching from both side at same time and meet at middle point and stop there ??
So time complexity should be b^(d/2) only na ??
Thank You Sir 😊
Thankyou 🙏
Thank u sir 👍🏻😊
Thanq sir🤗🤗
This doesn't seems right, if we already know the goal node then why we are doing this searching?
love you sir
is it depth limit search??
Sir, could you please add subtitles for AI videos? Thanks in advance.
Watching from Palestine 🇵🇸 ❤
Tf
What happens in the situation that you have several goal nodes on your tree
What will be order of explored nodes :(
As usual❤
Thank you sir
aaj se mai sare doston ko bidirectionally miluga 😏🤣🤣🤣
Thanks sir g 👍
level bfs and dfs dono ke niklenge lekin niklega jrur
sir lekin 9 se start karne ki zarrorat hi q hai ... 9 is the goal state....toh answr mil gaya na 9?
What if one follow bfs and other one follows DFS?
level sab ki nikle ge ......
level search technique
Discrete math plzzz🙂🙂🙂
You can follow knowledge gate lectures for discrete. They are really good
I understood the concept but how do we know where the goal state is to start any algorithm from that side?
bro the question u raised now is one of the disadvantage of this bidirectional search.
one should know the goal state in advance
Jai mahakaal 🔱
ager number of nodes even hu?
are you god or youtuber Bro?
Hello sir, mujhe aapse apne career ke bare me baat krni haii.. Plz sir apse contact kese kru..