this is one of the only videos ive found on graph theory
@pratikshachauhan41525 жыл бұрын
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.
@sagarpoudel85345 жыл бұрын
You can turn off your subtitle in the cc huttom here in taskbar of youtube display area.
@chinmayanand8968 жыл бұрын
please upload videos on graph theory problem solving....
@ravibramanandam2137 жыл бұрын
Shouldn't the time complexity be O(V*E)? because FOR Loop runs for every 1 WHILE loop iteration.
@chandniverma000097 жыл бұрын
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.
@hanq19994 жыл бұрын
I cannot see when does the method push_back() init? Does it belong to library & library ?
@mohneeshgarg87065 жыл бұрын
you should teach psedu code first then original code..otherwise it loook it looks just as you make us crame that code
@SergeyFominVL5 жыл бұрын
for me it's easier to understand it on real code
@learnwithme5102 жыл бұрын
How we are getting adjacent vertex in the first place? to check if visited or not
@sharmilaharsha45635 жыл бұрын
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
@sagarpoudel85345 жыл бұрын
Turn off the subtitle here in youtube task bar.
@shuvongkorbarman71596 жыл бұрын
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.
@mrarcticaaa11015 жыл бұрын
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-fu7yl7 жыл бұрын
very clear explanation thanks :)
@jayjagtap7873 Жыл бұрын
Indeed, one of the best explanations on the topic
@jaycrijaygandhi6 жыл бұрын
I had a doubt that in adjacency list the order in which the nodes in the is arranged, is the order for that specific?
@shoebmoin107 жыл бұрын
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);
@gouravmajee99133 жыл бұрын
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.
@omercak27466 жыл бұрын
Thanks for all these videos Sir
@GeeksforGeeksVideos6 жыл бұрын
Thanks Omer :)
@aanchalsharma52644 жыл бұрын
How to deallocate the memory that have been allocated using new function
@vaidhyanathansm76254 жыл бұрын
You can make use of delete() function .
@suryanshawasthi18154 жыл бұрын
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
@jushas92766 жыл бұрын
thank u sir it is very useful
@usmankabeer67763 жыл бұрын
This video is contributed by "illuminati" means ?
@RobertPodosek Жыл бұрын
Except if you did visited[1] you'd get the 2nd position in the array...
@asthajain72072 жыл бұрын
What about the driver's code
@charleslaine6 жыл бұрын
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-te4jn6 жыл бұрын
adjacent*
@hacking10076 жыл бұрын
realyy asome explanation sir and i suggest more example give
@2708meghu7 жыл бұрын
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
@GeeksforGeeksVideos7 жыл бұрын
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.
@2708meghu7 жыл бұрын
Thank You
@himanshupandeynitcs8 жыл бұрын
Nice explanation with dry run ... (y) (y)
@kiranmallikarjun86186 жыл бұрын
nice one but i didn't get clarity in time omplexity i.e O(v+e)
@guruaribamharish64376 жыл бұрын
good explanation thank you
@shawarmagames16894 жыл бұрын
Is this Rahul Subramanian by any chance?
@komalkasyap71047 жыл бұрын
very explained video..thanks and keep it up
@GeeksforGeeksVideos7 жыл бұрын
You're welcome, Komal! :)
@sumit12345yadav2 жыл бұрын
your TC calculation is wrong, it is O(v*e)
@lionb67256 жыл бұрын
I'm not understanding the logic part clearly. so will u pls clearly expain in another method??
@videovideoguy6 жыл бұрын
A graph can be represented by a Map as well
@chetank12836 жыл бұрын
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.abdullahalmurad23125 жыл бұрын
can i get the full code please?
@mirsahib5966 жыл бұрын
i don't get it if you print all the node then how do we know which is the shortest path
@ashrafulfuad29676 жыл бұрын
really helpful
@pagalshaitan64958 жыл бұрын
nice sir
@9ShivamSharma7 жыл бұрын
Mistake in adjacent vertices of 5 , you forgot 2.
@GeeksforGeeksVideos7 жыл бұрын
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.
@aanandhivb6 жыл бұрын
Its given in the captions
@dividuttunnikrishnan23666 жыл бұрын
Unable to see due to Subtitles...of u
@attrey2733 жыл бұрын
Turn it off
@harshvardhan4264 жыл бұрын
Sir jisko aap Queue bolrhe hain wo List hai
@pastafarian84104 жыл бұрын
what is the meaning of visited[*i] ?
@harshittripathi89354 жыл бұрын
Why bool *visited not bool visited?
@jaatharsh4 жыл бұрын
helpful
@ganeshrocky0017 жыл бұрын
show me the spanning tree of dis graph...
@mrarcticaaa11015 жыл бұрын
thank you, highly appreciated
@rennesshreddy66564 жыл бұрын
Sir can you do coding part in c language !!
@khushikumari99102 жыл бұрын
Sir code is not visible first make it visible then explain
@rupeshbhujel10055 жыл бұрын
thank you!!!
@mahmoudsayed1332 жыл бұрын
very nice and clear thank you (*_*)
@rajamouryasimhareddy14783 жыл бұрын
👏👏👏
@udaygupta45167 жыл бұрын
You are too slow in explanation.
@GeeksforGeeksVideos7 жыл бұрын
Thank you for your feedback, Uday. We have shared it with our contributor.
@shivankchopra74296 жыл бұрын
In that case I suggest you to watch at 1.25 or 1.5 times speed. I do the same.
@sagarpoudel85345 жыл бұрын
Those who need faster, plz get lost. Slow is well.