I agree. The intuition explanation was so helpful to my understanding of this algorithm, as well as to my understanding of graph behavior in general. Thank you!
very good explanation of the intuition on why the first step is topological sort. and then DFS on the reversed graph based on the order of the topological sort.
Yeah , you have been my goto person during this lockdown. Basically, whenever I get to know of some algorithm during CP which I need to learn, I head to your channel to see whether you had explained it or not. Just one thing : the plural of child is children and not childrens :)
I always wondered why a stack was used when a visited array could do the task. I searched a lot to find the reason and finally understood after landing here. Thank You for your service to the Community.
Nice one. In nutshell, we are topologically sorting the underlying DAG of reverse graph (with connected components as vertices), so that one strongly connected component cannot be traced from another strongly connected component.
Thank you! I've watched like 6 different videos and non of them helped do my homework, because none of them actually did a proper step by step explanation. But yours did! So thank you, I can finally do my homework and upload it.
I was stuck at this topic for an hour or so. Thank you for explaining with an example. Not only it was so easy to understand, no i believe that i can teach it somebody else too.
wonderful expalnation and the best part was now u are implememting the concept via code in your video. Earlier your videos gave insight but lack of code was a issue for me at least.Kudos to u ,keep going
Bro omg thank you, I implemented the entire in python from Wikipedia, but it was missing some details. You outlined everything I needed, now onto Johnson's alg
Dropping a comment bcoz I watched several videos but logically yrs makes the most sense and Im finally getting it right without contemplating which path to take
+Tushar Roy hey Tushar. I am preparing for interviews and ran into a question. This might be helpful for others too. Let's say someone asks me to write code related to strongly connected components or topological sort. Is it enough to write those two to four functions that deal with the actual implementation or should I write some prep code as a starting point. Unlike binary/tertiary trees, graph representation is not unique. Say you may be representing a weighted DAG using lists and I may be using arrays (being lazy!!!). Moreover I never faced any graph related problems in a limited number of interviews I attended and so this confusion. Please comment based on your actual interview experience. Thanks..
great explanation. like all other videos.. what I liked in this video specially the way you explained why this algorithm works.. when I dry run is over.. I was thinking.. lets think how it will work and why it will work.. and this explanation was just there after that..
wonderfully explained the intuition. most videos on TH-cam give the algorithm without justifying the steps.
I second that :)
I agree. The intuition explanation was so helpful to my understanding of this algorithm, as well as to my understanding of graph behavior in general. Thank you!
Welcome
very good explanation of the intuition on why the first step is topological sort. and then DFS on the reversed graph based on the order of the topological sort.
Yeah , you have been my goto person during this lockdown. Basically, whenever I get to know of some algorithm during CP which I need to learn, I head to your channel to see whether you had explained it or not.
Just one thing : the plural of child is children and not childrens :)
Why this algorithm is work ? Make difference between you and other instructor ✨✨✨✨
Nice !!! Superb
Very nice explanation of the intuition.
"By intuition that we discover and by logic that we prove" - Henri Poincaré
This is beautifully explained. I was struggling to find an intuitive explanation for why this algorithm works until I found this video. Thank you!
Great job. Whenever I search any algo on TH-cam I search for your videos first. You explain everything simply and quickly.
Wow, clear and straightforward explanation, wish I could give two likes!
Nice video Tushar! I recognized you at the first sight of this video. It is very clear explanation and really helps me understand the intuition. Thx!
He makes it look so simple!
Hats-off to him :)
You should keep making videos man... They are honestly some of the best videos on youtube for algorithms and data structures.
I always wondered why a stack was used when a visited array could do the task. I searched a lot to find the reason and finally understood after landing here. Thank You for your service to the Community.
I've been stuck on this for months. Finally... thank you!
Nice one. In nutshell, we are topologically sorting the underlying DAG of reverse graph (with connected components as vertices), so that one strongly connected component cannot be traced from another strongly connected component.
that's a really elegant explanation! I wish the Algorithm Design Manual explained it like that
Thank you! I've watched like 6 different videos and non of them helped do my homework, because none of them actually did a proper step by step explanation. But yours did! So thank you, I can finally do my homework and upload it.
adbhut avishwaniya .. itna accha explanation .. bahut kam hi dekhne milta hai ...
great tushar bhai ! !
excellent explanation, thanks!
I was stuck at this topic for an hour or so. Thank you for explaining with an example. Not only it was so easy to understand, no i believe that i can teach it somebody else too.
Thanks for the video.
Might be helpful to mention that the first pass of populating the stack is similar to topological sort.
Amazing explanation of that guaranteed exploration part of vertices that makes the concept crystal clear.Thanks
Wonderfully explained. A lot to learn from you. Keep up the good works.
wonderful expalnation and the best part was now u are implememting the concept via code in your video.
Earlier your videos gave insight but lack of code was a issue for me at least.Kudos to u ,keep going
clear illustration. all your videos are so awesome. thank you for your effort
excellent !!!!!!!!!!!!!!!!!!!!!!!!!!!!! amazing to have you in youtube!!!!
Dude, you are awesome,
You finished all my doubts that came into my mind sequentially while watching this video.
Hats off _/\_
Great work! Thanks for putting up this awesome video! It really helped my studies.
Perfect explanation step by step. Good job 👍
Every time when I want to revise SCC I see this Video. Best Explanation
The explanation was very well explained. Thank you so much!!
Tushar you are the man...helping many students in my algo class handle biz
Thanks tushar, I was actually looking why this algorithm works. This helps me a lot. This seems simplictic than tarzan
Amazing explanation of the intution behind the algorithm.
Very well explained Tushar. Especially the "intuition" part.
That was great! Crystal clear explanation, thanks
What an amazing explanation. Thank you very much!
Bro omg thank you, I implemented the entire in python from Wikipedia, but it was missing some details. You outlined everything I needed, now onto Johnson's alg
That was a great explanation and the idea behind why the algorithm works is best 👌👍👍
nicely done. well prepared, clear, and easy to follow. kudos
Thanks for such a detailed Explanation. Please upload some more videos on ML and AI , It will be quite helpful for all of us..Thanks
At some point, the learning stops and the pain begins.
Thanks a lot Tushar - u really save me lots of hours trying to figure out written stuff =]
Awesome explanation Tushar! Thank you :)
Dropping a comment bcoz I watched several videos but logically yrs makes the most sense and Im finally getting it right without contemplating which path to take
Bhai bohot kadak padhaye Hain aap !!! Thank bro 🥰
Best ever explanation on you tube till date
Thank you so much for making this video. Finally understood the algo intuition
Wow! Extremelly clear explanation. Thanks a lot
Fantastic explanation. Congratulations!
Very clear explanation Tushar!
Good work Tushar! I just discovered you're from MNIT. Pleasant surprise!
Intution Explanation is really awesome. Thanks
Thank you very much, this was really helpful! Good job! :D
thanks man, your class helped me a lot
You are really good at teaching Tushar Thanks alot
fantastic video, i like the meticulous style of your explanation.
Oh man. You are something. Thanks for such simple explanation as usual.
+Tushar Roy hey Tushar. I am preparing for interviews and ran into a question. This might be helpful for others too. Let's say someone asks me to write code related to strongly connected components or topological sort. Is it enough to write those two to four functions that deal with the actual implementation or should I write some prep code as a starting point. Unlike binary/tertiary trees, graph representation is not unique. Say you may be representing a weighted DAG using lists and I may be using arrays (being lazy!!!). Moreover I never faced any graph related problems in a limited number of interviews I attended and so this confusion. Please comment based on your actual interview experience. Thanks..
just what I needed - thanks bud!
The explanation of the proof why this algorithm works is super awesome.
Awesome explanation, thank you!
very very nice explanation and the justification is what was needed..thanku
absolutely perfect explanation!
Thank you so much for such a nice explanation!!!!
great explanation. like all other videos.. what I liked in this video specially the way you explained why this algorithm works.. when I dry run is over.. I was thinking.. lets think how it will work and why it will work.. and this explanation was just there after that..
Thanks for explaining the intuition.
Hats off to you.. Thanks for such a nice explanation..
Thanks Sir, For such a great explanation.
Very good explaination, thank you Roy
You are the best man
Awesome work......Lot of thanks to you for posting this. Please post videos on Treaps and LCA.
Great work great explanation
Nice Video, very simple easily instruction of a complex problem
explained the khode very beautifully ...
Thank you. Very nicely explained.
very detailed and clear explanation,thank you.
Clearly explained, thank you so much
Amazing intuition provided!
Thank you so much Tushar.. This really going to help me a lot in my externals.. :)
Thank a lot..exactly what I was looking for :)
awesome explanation!! Thank you so much
Fantastic intuition!
Very useful, thank you. :)
amazing explanation. Thank you for this video
Wonderful!!! you helped me a lot, thanks!!!
Amazing explanation !!
I finally understand why we reverse the graph!
Thanks a lot for great explanation.
Great explanation, thanks buddy!
thank you what a high quality works
Really well explained, thanks!
This is so helpful, thanks!!
very nice explanation ... Really helpful tushar
Very well Explained ! Thank you :)
thank you so much sir...
Really awesome explanation.
very understandable explanation. Thank you sir.
what a wonderful explanation
nice explanation especially why the algorithm works
Awesome explanation !!
surprisingly a good explanation.thanks!
Great explanation! Thank you so much!!
true!
Wonderful explanation, subscribed
Very well explained. Thanks
Keep up the good work!