Breadth First Traversal for a Graph | GeeksforGeeks

[@reyou7]

GeeksforGeeks is always in business!

[@shyamprakashm6325]

😂😂😂👌👌👌

[@anirudh9900]

Perfect to the point explanation. Thank you!

[@rahulrawatlive]

a crystal clear explanation...very good.

[@GeeksforGeeksVideos]

Thank you, Rahul.

[@shivadeepus4581]

yeah very well explained

[@SharminAkter-vi2vt]

Slow explanation is very helpful😊

[@GeeksforGeeksVideos]

Glad you found the explanation helpful. :)

[@firstcomesrock8593]

this is one of the only videos ive found on graph theory

[@pratikshachauhan4152]

Sir firstly thank you very much, but I have some problem due to English subtitle the code under this title is not clearly visible. So please do something to resolve this problem.

[@sagarpoudel8534]

You can turn off your subtitle in the cc huttom here in taskbar of youtube display area.

[@chinmayanand896]

please upload videos on graph theory problem solving....

[@ravibramanandam213]

Shouldn't the time complexity be O(V*E)? because FOR Loop runs for every 1 WHILE loop iteration.

[@chandniverma00009]

For the BFS function's complexity, V in O(V+E) is due to the initialization loop and if you notice carefully the second outer while loop's inner for loop statements are run 2E times in total summing over all the outer-while-loop's iterations. They are *not* run O(E) times per outer-while-loop's iteration. Hope that makes things clear for everyone.

[@hanq1999]

I cannot see when does the method push_back() init? Does it belong to library & library ?

[@mohneeshgarg8706]

you should teach psedu code first then original code..otherwise it loook it looks just as you make us crame that code

[@SergeyFominVL]

for me it's easier to understand it on real code

[@learnwithme510]

How we are getting adjacent vertex in the first place? to check if visited or not

[@sharmilaharsha4563]

Content delivary, explanation, examples and the flow everything is good but the text appear on the video is hiding the content.... disturbing please correct it.... otherwise it is awesome

[@sagarpoudel8534]

Turn off the subtitle here in youtube task bar.

[@shuvongkorbarman7159]

After the first item 1 is pop out from the Queue, the queue became empty. And you have used a while loop with the logic (!queue.empty) which means queue is not empty. So according to your logic, the while loop will run only once! Please explain it.

[@mrarcticaaa1101]

It will pop first element, then enters the loop and pushes first element's vertexes. So queue won't be empty on second loop of while.

[@sachinverma-fu7yl]

very clear explanation thanks :)

[@jayjagtap7873]

Indeed, one of the best explanations on the topic

[@jaycrijaygandhi]

I had a doubt that in adjacency list the order in which the nodes in the is arranged, is the order for that specific?

[@shoebmoin10]

why does code give a segmentation fault for the following input: Graph g(5); g.addEdge(1, 2); g.addEdge(1, 3); g.addEdge(2, 4); g.addEdge(3, 5); g.addEdge(4, 5);

[@gouravmajee9913]

when g is 5 it means you have allocated 5 space (0-4 vertices) and now you are making and edge with 5 also which is not possible thus make graph g(6) to insert till 5.

[@omercak2746]

Thanks for all these videos Sir

[@GeeksforGeeksVideos]

Thanks Omer :)

[@aanchalsharma5264]

How to deallocate the memory that have been allocated using new function

[@vaidhyanathansm7625]

You can make use of delete() function .

[@suryanshawasthi1815]

if i will do it by map instead of creating link list will it be considered cheating if someone is testing my knowledge of dsa say in an interview

[@jushas9276]

thank u sir it is very useful

[@usmankabeer6776]

This video is contributed by "illuminati" means ?

[@RobertPodosek]

Except if you did visited[1] you'd get the 2nd position in the array...

[@asthajain7207]

What about the driver's code

[@charleslaine]

It would help if I could understand the speaker. At 3:01 I literally cannot understand this... "We check if vertex is or not.

[@AJ-te4jn]

adjacent*

[@hacking1007]

realyy asome explanation sir and i suggest more example give

[@2708meghu]

This video is great to understand BFS but I found difficulty in understanding predecessor graph of bfs which is a small topic in bfs chapter. Help me understand that

[@GeeksforGeeksVideos]

Thank you for your feedback, Megha. I don't think we have an article covering that. Presently, we are only making videos on previously published articles. I have shared this topic with our content team.

[@2708meghu]

Thank You

[@himanshupandeynitcs]

Nice explanation with dry run ... (y) (y)

[@kiranmallikarjun8618]

nice one but i didn't get clarity in time omplexity i.e O(v+e)

[@guruaribamharish6437]

good explanation thank you

[@shawarmagames1689]

Is this Rahul Subramanian by any chance?

[@komalkasyap7104]

very explained video..thanks and keep it up

[@GeeksforGeeksVideos]

You're welcome, Komal! :)

[@sumit12345yadav]

your TC calculation is wrong, it is O(v*e)

[@lionb6725]

I'm not understanding the logic part clearly. so will u pls clearly expain in another method??

[@videovideoguy]

A graph can be represented by a Map as well

[@chetank1283]

Hello Sir, Can you help me to solve the problem which is from ACMICPC? I read that problem statement but i am not getting a right way to solve it and i am thinking it is based on graph. So if you help me then i will try to solve the problem.

[@md.abdullahalmurad2312]

can i get the full code please?

[@mirsahib596]

i don't get it if you print all the node then how do we know which is the shortest path

[@ashrafulfuad2967]

really helpful

[@pagalshaitan6495]

nice sir

[@9ShivamSharma]

Mistake in adjacent vertices of 5 , you forgot 2.

[@GeeksforGeeksVideos]

Thank you for pointing this out. We will add the note. Regarding the example, you would not need to do anything for 2 as it is already visited.

[@aanandhivb]

Its given in the captions

[@dividuttunnikrishnan2366]

Unable to see due to Subtitles...of u

[@attrey273]

Turn it off

[@harshvardhan426]

Sir jisko aap Queue bolrhe hain wo List hai

[@pastafarian8410]

what is the meaning of visited[*i] ?

[@harshittripathi8935]

Why bool *visited not bool visited?

[@jaatharsh]

helpful

[@ganeshrocky001]

show me the spanning tree of dis graph...

[@mrarcticaaa1101]

thank you, highly appreciated

[@rennesshreddy6656]

Sir can you do coding part in c language !!

[@khushikumari9910]

Sir code is not visible first make it visible then explain

[@rupeshbhujel1005]

thank you!!!

[@mahmoudsayed133]

very nice and clear thank you (*_*)

[@rajamouryasimhareddy1478]

👏👏👏

[@udaygupta4516]

You are too slow in explanation.

[@GeeksforGeeksVideos]

Thank you for your feedback, Uday. We have shared it with our contributor.

[@shivankchopra7429]

In that case I suggest you to watch at 1.25 or 1.5 times speed. I do the same.

[@sagarpoudel8534]

Those who need faster, plz get lost. Slow is well.

[@allhdmoviescene1294]

teaching method is so boring

[@jigglephysicsresearch]

Clear explaination! Chicks must love you!🤣