G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs

GfG-Problem Link: bit.ly/3bn84K8
C++/Java/Codes and Notes Link: takeuforward.org/graph/breadt...
DP Series: • Striver's Dynamic Prog...
SDE Sheet: takeuforward.org/interviews/s...
Check out our Website for curated resources:
Our Second Channel: / @striver_79
In case you are thinking to buy courses, please check below:
Code "takeuforward" for 15% off at GFG: practice.geeksforgeeks.org/co...
Code "takeuforward" for 20% off on sys-design: get.interviewready.io?_aff=takeuforward
Crypto, I use the Wazirx app: wazirx.com/invite/xexnpc4u
Take 750 rs free Amazon Stock from me: indmoney.onelink.me/RmHC/idje...
Earn 100 rs by making a Grow Account for investing: app.groww.in/v3cO/8hu879t0
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
---------------------------------------------------------------------------------------------------------------------------

[@takeUforward]

Let's continue the habit of commenting “understood” if you got the entire video. Do follow me on Instagram: striver_79

[@GauravThinks]

Bhaiya next bideo🥺 pls

[@amarjeetkumar-hk2jl]

US

[@BhavyaJain-qz8jg]

understood

[@sanketatmaram]

👍🏻

[@SahilMadaan001]

understood

[@UECSoumyaRay]

I can proudly say that this summer I watched more tUf lectures than Netflix episodes.

[@aniket6858]

Because your placement season is here

[@Moch117]

@@aniket6858 What is placement? Is this india

[@joseph2073]

@@Moch117 no, its pakistan.

[@congdatt]

what is the result ?

[@montynathan3318]

Yoh Netfilix ke hovey?😶‍🌫️

[@somz21ad]

Hey Striver! Thank you for creating outstanding content and helping people interested in coding problems worldwide! Please don’t stress yourself out, take a break after this one. It’s not easy to work full time and dedicate time for this.

[@nkgautam6161]

you are great striver. Explain such a complex topic in very easy manner. Your method of teaching is unique, a unique lecture by a unique teacher🙏🙏🙏

[@gourabbhattacharjee2128]

Just some simple words! No one can beat your DSA teaching style!!

[@creativearts6406]

I like the way you explain time and space complexities, which actually helps me to analyze my code complexities. Thanks for the explanation.

[@thealgorithm7535]

after seeing your post on LinkedIn that you are launching graph series 2.0 i used to see your KZbin playlist daily now I am very happy thank you very much 💗

[@asadeducation9513]

understood..awesome..most of the youtuber's don't explain a topic in depth... great video

[@raghvendrakhatri5848]

Understood each and every word♥. Kudos to your hard work and dedication, you are the motivation behind a lot of people. Your hardwork inspires a lot of people to work hard. Thankyou for providing such a beautiful graph series keep posting such content ♥, we all need this.

[@cinime]

Understood! Awesome explanation as always, thank you so much!

[@priyadarsinipaikaray4998]

You are amazing 🤩 Guru wo hota h jo muskil si cheez ko v Asan karde tushi great ho ji striver ❤

[@arthurdark3945]

Are you going to teach leetcode questions just like you did in DP series? It would be very helpful if you can teach commonly asked good questions covering different graph patterns and not just the basic ones.

[@takeUforward]

Yups, this one is going to be 50+ videos.

[@pranavsharma7479]

@@takeUforward bro try to cover as max you can till 15 aug, thnks for helping

[@chitrankusarkar7278]

17:04 i was still wondering where the heck vis[n] came from. edited like a pro

[@nextnotification9857]

same bro

[@poetrystation3178]

this code is not running editor is a pro for sure

[@rajsekhardutta8891]

What an amazing explanation! Understood! 🤩❤‍🔥

[@p38_amankuldeep75]

great content loving this after completing dp series💙💛💙

[@farazjawaid2982]

a well explained and organised lecture !!!

[@tanaysingh5348]

very well explained with all the minute details

[@satishsingh8297]

Thankyou striver bhaiya! ❤️

[@umeshkaushik710]

Great work. Thanks for doing this.

[@akshaikumar7966]

i loved it sir , what a beautiful explanation

[@Maunil2k]

Nice and crystal clear explanation !!

[@paullater6230]

understood!! Explained beautifully!!

[@kulkarnisoham]

Awesome Space & Time Analysis 🔥🔥🔥🔥🔥🔥🔥🔥

[@tharaniarumugam-zb9il]

Your videos never fail to save us anytime :) Undhan rasigaiyee naaum unaken puriyavillai...

[@raiusamaakram]

brilliantly explain thanks sir and neeed complete playlist of DSA from you for cracking google like companies

[@anuraggoswami3534]

57 +videos trurly 🇮🇳 biggest graph series Ironically GOAT 🐐 is teaching GRAPH 🤩

[@Sillysmiles76]

Understood, Happy Learning🤗

[@ramanpareek5218]

Liked the video, notes taken, understood

[@mahaprasadm9770]

brilliant explanation!

[@simmi641]

Thank you so much stiver. Happy Teachers dayy

[@rishabhagarwal8049]

Understood Sir, Thank you very much

[@ayat_middya]

Wonderful bhaiya.....

[@RajeevCanDev]

outstanding explanation!!

[@vakhariyajay2224]

Thank you very much. You are a genius.

[@stith_pragya]

Thank You So Much for this wonderful video...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@sripriyapotnuru5839]

Thank you, Striver

[@jatilyadav4000]

Great video Loved it

[@aditya_raj7827]

You are amazing striver ❣️

[@aniketshukla2426]

What about Directed Graphs, It applies for them too? I think yes, because the adjacency list will only have those edges so we only traverse those edges

[@udaypratapsingh8923]

here we go !

[@shashankdesai8650]

Ohoo masthhh bhaiyaaaa Woohoo

[@likhitbhogadi]

hats off to ur hard work.

[@abhichi]

Understood..next please ✌🏻

[@yashpadiyar4952]

Thankuu sooo muchhh broooo🤗🤗🤗❤❤❤❤❤

[@ancycoding]

BEST DSA TEACHER FOR ME

[@vikasbagri1225]

understood very well...

[@tanvirhasanmonir1627]

Thank you, understood!

[@subhamoybera6456]

Great explanation

[@alt-f4gaming222]

congrats bhaiya for 300k ek din apan sath me 1m jayenge

[@samuelfrank1369]

Understood. Thanks a lot.

[@morganyu3391]

Understood bhaiya!

[@supriyamanna715]

coded on my own! Got an error, resolved the issue, all TC passed! Note taken

[@futurev14]

Toh tujhe kya lg rha bada jhanda gaad diya tune saale itne chappal maruga

[@aniketshukla2426]

I'm confused on the Time complexity, If we know the while loop runs N times and the size of the adjacency list is 2E, It is alright to add them to get the time complexity? like, the while loop runs N times and the for loop overall runs 2E times..??

[@addictedtocricket8827]

how can someone be so perfect in explianing concept

[@shyren_more]

understood, thanks!

[@nandini2783]

Thankyou striver!

[@kritagyaprasad7230]

Great Content

[@ankitz007]

Understood, Sire!

[@codeman3828]

Great series

[@gunahawk6893]

Woah nice explanation

[@selene8721]

Thank you so much!!

[@paulangelp7099]

Fantastic 🎉 Understood

[@hrushi_borhade]

understood striver!!

[@kartikshukla5018]

Thanks sir .... best solutions

[@user-mt4jk5gq7g]

you are the best stiver

[@aasifali9139]

thx striver. Understood.

[@tasneemayham974]

bestttt!! understoodddd

[@adityaroychowdhury3709]

understood thankyou very much

[@varunkumar-vs5wc]

all clear thank u bro

[@parthivsarkar6835]

Understood💯

[@udayrajvadeghar8555]

UNDERSTOOD!

[@_hulk748]

Understood sir❤🙏🙇‍♂

[@Highlights_Point]

Thanks Bhaiya

[@BharatKumar-rc8vn]

made it simple to understand

[@sagaravhad5198]

Thank you so much.

[@radharamamohanakunnattur3035]

A Big Thanks!!

[@shubhigupta5689]

Understood🌻

[@farheenkhan3248]

just thank you 🙏

[@YeaOhYeahh]

If u r confused about time complexity part, then see the following dry run of the while loop of the qs. he has solved.. This is how nodes are connected(assuming undirected graph) : 0 -> 1 ,2, 3 1 -> 0 2 -> 0, 4 3 -> 0 4 -> 2 So, total no. of edges = E = 4 For first while loop , node = 0, edges = 3 Now, before going to the for loop part, u see a constant time operation O(1) --> q.pop( ) This step will be executed every time we enter into while loop. So, for first while loop how many times for loop will execute ?? It will be equal to the no. of edges , here it will be 3. Therefore, total = ( 1 + 3 ) Similarly for all other nodes, this is how it will look : ( 1 + 3 ) + ( 1 + 1 ) + ( 1 + 2 ) + ( 1 + 1 ) + ( 1 + 1 ) = 13 = O ( V + 2 * E ) = O ( 5 + 2 * 4 )

[@sumerrawat6947]

Very well explained !

[@Saurav_Kumar514]

Awesome 👌👌

[@mypowerlevelisover9000]

Thank you

[@YeaOhYeahh]

@@mypowerlevelisover9000 🙂

[@shaikhfaisal2423]

but at the worst case it will be O(n^2) right? since a complete graph have all the vertex with (n-1) edges. which will lead [(1+(n-1))=n] at each while and for loop. since after n times it will become n square. Please confirm this. BTW thanks for the explaination

[@rameshbabuy9254]

please also explain space and time complexities

[@siddheshborse3536]

Understood. 😊

[@LBK3]

Understood ❤

[@ANURAGSINGH-nl2ll]

understood thank you

[@dilsedhoni9229]

Understood ❤❤

[@hakunamatata-nl4js]

Thank you

[@UECAshutoshKumar]

Thank you sir

[@mriduljain6809]

Understood Bhaiya

[@fmkhandwala39]

understood!

[@Shivam-fl6uv]

Understood 👍

[@TON-108]

Understood 🥳🥳

[@Shivi32590]

thank you

[@KartikeyTT]

tysm sir

[@manasranjanmahapatra3729]

Understood!

[@shreyyyc]

Thanks a lot stiver for putting all these playlists out. i can't imagine getting a job if you were not on youtube. i have a little doubt that in "bfsOfGraph" function the syntax of adj[ ] should be this "Vector> adj [ ]" but it is "vector adj[ ]" instead and this is a 1D vector not a vector of vector.

[@iitbhuvictim]

Here you're creating an array of vector.... basically number of vector is fixed....that is the way to create array of vectors

[@lakshsinghania]

there is a similar comment in the video number G-2 check that out

[@ayushmishra9758]

Hence, vectoradj[n] n is no of vertices.(0 based) . adj creates an array where each adj[i] is a vector itself. Array of VECTORS.

[@prachi1112]

Same doubt. if we're storing an array at each index of the vector, shouldn't it be vector adj instead of vectoradj??

[@ShivamTh405]

@@prachi1112 We are storing vector in array index, i.e array of vectors. Every node of array denotes an array . Eg -> if we write int arr[] , here data type is int , so it is array of integers, but if we write vector arr[] , here data type is vector , so it is array of vector

[@ankit_s]

Amazing

[@MischievousSoul]

There was some sound glitch for 30 sec.. Was weird but Loved the way you teach and i am here after conpleting your trees playliat... ❤

[@mriduljain1981]

understood.

[@worthlessguy1621]

understood :)

[@jagadeeshp1163]

understood✅

[@animalbyte453]

Understood!!