Breadth First Search | BFS | Examples | DAA | Design & Analysis of Algorithms | Lec-30 | Bhanu Priya

[@ashrafdya9869]

You're an awesome teacher thank you india for bringing you to us ;-)

[@ummerubab913]

SUCH AN OWSUM EXPLANATION MAM THANK U SO MUCH...........

[@tapadiptobanerjee2284]

Maam,here in the graph 10 11 will not in enqueue operation because of 10 and 11 are seperate in1 to 9.Right.

[@aviatattar6634]

What did we get after this much work??

[@study3783]

What happens to the vertices 10, 11

[@VasuPrio]

best video over internet

[@z0dth3g0d]

What about the Vertices 10,11, Wont they also be considered??

[@srivyshnavi6271]

Ma'am, you started with vertex_1 after that you had choosen 2 .what if I take 4???
Please answer...

[@CSEconceptswithParinita]

Yes, you can take. You can refer my video on the same topic: ruclips.net/video/2_oELq_NqS0/видео.html

[@jain5184]

It will be consider

[@jayajaya4862]

Nice lecture maam

[@jatindrachandrasingha5417]

How to search 10 and 11 as it is a disconnected graph?

[@vandhuvarshu4661]

By the BFS property, 10 and 11 neither connected to the starting vertex ( i.e. 1 ) nor to any of that the visited vertices. And that's why I think I cannot be listed in queue.

[@nidishmacharla1671]

Excellent job ## do more topics

[@bindukrishnam8311]

Super mam baga chaparuu

[@motivational-matrixiq]

i understand but how does one answer in the exam for instance

[@education4uofficial]

@@motivational-matrixiq
class notes ( pdf )
education4u.in/

[@dimitriosvavatsioulas8949]

No no no... Running BFS using a stack DS is making things complicated. Instead prefer this: BFS->Queue & DFS->Stack

[@CSEconceptswithParinita]

Yes, you are right. You can refer my video on the same topic: ruclips.net/video/2_oELq_NqS0/видео.html

[@abinsha20]

Correct

[@ravisinghrawat5644]

thankyou so much

[@ABHISHEKSHARMA-nv1zu]

ur answer is incorrect ...... correct ans is 124356798.....and u r using stack for bfs .....but queue is used for bfs ...and stack is used for dfs

[@sivaramakrishnapendyala2263]

Ur answer is wrong

[@CSEconceptswithParinita]

Yes, you are right. You can refer my video on the same topic: ruclips.net/video/2_oELq_NqS0/видео.html

[@rehanmondal4529]

No this is FIFO,Not LIFO, only the table has formed Vertically in place of horizontal

[@madhurataldeokar3049]

No she is right....check ur ans

[@sanufaris2707]

Very usefull

[@brendanr8828]

Thanks!

[@ketankamble9748]

Tqs mam❤

[@ReddyReddy-iz7bw]

Madam u not tell about 10 and 11 ...

[@anlam1360]

BFS just travels to the reachable nodes. If you want to print all the nodes, it is something else.

[@shaikzubair5926]

after getting an answer of bfs.how constrt again in to d tree??

[@balaguravareddyt6599]

Supper madam

[@sanufaris2707]

Nice

[@SaadAli-bb7jd]

Shukrea :)

[@anish8292]

10 and 11 be like - itna chubne lga hun chura to nahi

[@TheDIVINEcasteR]

what about 10 and 11?

[@ummerubab913]

where is dfs...............

[@hanithhoney6592]

ur drawing stack diagram , first learn

[@CSEconceptswithParinita]

You can refer my video on the same topic: ruclips.net/video/2_oELq_NqS0/видео.html

[@hangovertelling]

dislike for flag finger

[@clothyeservice4172]

pahele khud concept clear koro then dusro ko padana