Breadth First Search (BFS) Algorithm in Hindi with Example
Vložit
- čas přidán 7. 05. 2018
- Breadth First Search (BFS) algorithm traverses a graph in a breadth ward motion.
BFS algorithm uses Queue data structure.
BFS Algorithm:
START
Step 1 − Visit the starting vertex and mark it as visited.
Display it.
Set a pointer to the starting vertex.(Currently working Vertex.)
Step 2 − if( Currently working Vertex has adjacent unvisited vertex )
{
Visit the adjacent unvisited vertex and Mark it as visited.
Insert it in a queue. (enqueue)
Display it.
}
else{
Update the pointer to the first element of queue.
Remove the first element from queue. (dequeue)
}
(repeat rule 2 until the queue is empty)
END
If you have any doubts please comment.
Don't forget to Share and Subscribe.
Email: srn.program.1111@gmail.com
facebook: / sourav.s.nag
Twitter: / srn9999
Great sir i appreciate your efforts...massive respect 😍
Bhai bhut achhe se full marks wala samjhaya bhut hi well 👏👏thnx
Thank you so much to you too..👌👌superb explanation.
Bhaut he acche vidoe hai bhai es topic par
Thnx 🙏🙏🙏👍 video banane k liye
Thnx 😀😀😀😀😀😀🙏👍👍👍👍
Thankyou very much😍 maine ye video full speed me dekhi 😉 i want to save my time 💯
Nice explanation ....
Excellent method thank you Sir✋
Great 👍👍👍 thanks a lot I understand this lecture in easy way🥀🌹💗👌👌👌👌
thanks..please also add some related Examples in each lecture.
wah je zabardast kya asaan banaya tu nay es tarah say explain karte raho
thank you sir so much... bht achii smajj aii
Hatts off to u sir ....best learning channel on CZcams 😍😍😍
Thanks for supprot bhai.
Very useful thank you 👉🙏💕
Nice explanation...thanxxx sir
Great vdo sir thank u sir
Thankyou so much sir.... Thanks alot......
Amazing 💯💯💯💯💯
Good explanation 👍
Thanks sir . Awesome video.
Shruti Ghosh Welcome dear. Best of luck
Hello sir can i write this algorithm in AI and DAA both subjects??
sir thanks apko nhi bolna chahiy, thanks to wiewers ko bolna chahiy itne easy ways se topics ko explain krte hai aap
so again thank u so much sir
best ..thanks sir
best❣️
best one
Shukriya 🙃 🙃 sir
well explained.thank u
☺
u nailed it
excellent sir
I love that your voice 'H'😊
Mast Bahiya ji
Thxx u sir
mazaa aa gya
Superb bro
Good Job Sir
6 mahine kuch nhi padha...ab 6 din bache hai exam ke to ye samjhne aaya... fir milunga agle 6 mahine baad jab 6 din bache honge exam ke
us bro us 🫂
Mst padhate ho sir
BEST
Tqq❤️❤️
Nice bht acha samjhaia ap ny
mian noman frm pakistan
Thanks brother. Love from India
Nice sir
thnx
Best sir 👍👍👍
Sir aap saaray bca subjects k banana ...mjy bht saary backlogs...woh clear hojatay
Beautiful Smiles - Lyrical Kashmir Haan bhai banaunga dhire dhire.
Very halpful
Good
Best video
Thanks brother. keep supporting us.
Hello sir apna bohot clear smjhate hai ur streatgy 👍👍👍
Plz linked list pr bhi videos bana kr update krdo exam ane wale hai June m plz jaldi krdo
Ignou me padhte ho
Kis semester ho bhai
Sir mcs21 k liya Jo exam 14 December ko h important bta dijiya ISS bare k Kiya plzzzzz sir
Purane wale suggestion se ready krte raho. Mein aaj rat ko kuch topic bata dunga.
sir paper me vi aise karni hai kaya.
Sir mca k liye video banao mcs031 k plzz
I am unable to understand as how can I remember this for tomorrow\s exam
sir ucs and a* algorithm pr be bnaen video plz
Sir please upload videos on AVL Tree. Exam samne a raha hai . Plz plz plz
pls make video on construct of binary tree(inorder,preorder ND postorder)
ok bhai karunga
Hi sir pointer arrow ko every step per update karna hai exam me because aisa hoga toh hume bahut sare diagram banana hoga. please clear it how to present diagram in exm
Each step ke lien diagram dikhana padhe ga.
See the link: www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/
bhai exam close hai aur jo kuch v necessary topic exam k liye upload kr dijiye AI ka. plz plz
haan bhai. 65-70% tak ho chuka hai. baki kosish karunga.
can i write this algorithm in hindi by translating...or exam me likh skta hu plz tell me sir
Bhai exam english me hota hai, hindi me nahi likhna hai
me hindi medium se kr rha hu..to mujhe hindi m likhna pdta h
+Exam Aasaan Hai !!! davv university se...hmare yaha jyadatr hindi se hi krte h b.sc
Bro make video on BCS 031
prince abrol sorry bro is sem me bcs 31 nahi hoga. next sem me start karenge.
It's okk...bro.....
Speed up to 1.75, and thank me later, Good luck for the exam
Wo bhai pehle ye to clear karlo ki kon kiska adjacent hai
Pehle A ka adjacent BCD kaha fr kah rahe ho ki C ka adjacent D hai pehle yehi clear karlo bhai
Ye to me 2 second me bata dunga isme itna algorithm batane ki kya zaroorat hai ye to sab ko dikhta hai ABCDEFGH
Apko dikhta hai, computer sahab ko nai. So computer ko coding se dikhana padhta hai
U r awesome
Thanks bhai. :)