Wow what a roller coaster ride of an algorithm! Not gonna lie I am feeling sick after watching the whole video! Thanks for uploading though. I came here because the textbook was proof heavy but now I think I really need to read the text book five more times to digest this haha.
I always wanted you to upload this video. This is the most intuitive explanation of why Kosaraju algorithm works and is it similar to Kahn's algorithm coupled with some key observation. God bless you.
I had put together most of a video for this a few years back, but at some point, a different intuition struck me. I wanted to go back to remake the two TopSort videos, this one depends on them, and it took me a while to get to them...
Hi. Thanks you for putting so much effort into your videos :) I have over 15+ years of experience, working in top companies, watched and read tons of material. And your way of presenting is my favorite :) I understand that majority comes from Cormen but your presentation soooo simplier, condense and fun to watch!!!
It took me a long time to get the intuition behind DFS topsort. I could prove it worked, but didn't have the intuition. When that finally came, this one was a byproduct. I stopped a previous version of this video I was making, and waited until I had time to go back and remake that one before finishing this one.
Thanks for it. I was stuck and confused on first step of Kosaraju algorithm, thinking of "why do we need to perform DFS first and find the finishing time for each node ? Just reverse the edges and now perform DFS". But, later reached here, and got to know for the "EFFICIENCY" ?
I use Cormen's book the most, so I am most familiar with this one. Also, I feel like I had a good intuition of why it works. Finally, without the intuition, I think it is really surprising that stringing together 3 simple algorithms seems to give an answer for a seemingly unrelated problem. I might make one for Tarjan's approach someday, but isn't too close to the top of my queue right now.
The animations are svg in javascript. I would like to make some interactive exercises with them, but it would take even more time than the videos, and I don't know exactly what demand there would be for them.
That's an excellent explanation, specially how both the topological algorithm is used to find the SCC. One of the best videos on the internet 👌👌
David Scot Taylor, you are a hero.
Congratulations, you have written a short sentence that has never been written before.
Overdue!
Wow what a roller coaster ride of an algorithm! Not gonna lie I am feeling sick after watching the whole video!
Thanks for uploading though. I came here because the textbook was proof heavy but now I think I really need to read the text book five more times to digest this haha.
So happy that you're back!!
I always wanted you to upload this video. This is the most intuitive explanation of why Kosaraju algorithm works and is it similar to Kahn's algorithm coupled with some key observation. God bless you.
I had put together most of a video for this a few years back, but at some point, a different intuition struck me. I wanted to go back to remake the two TopSort videos, this one depends on them, and it took me a while to get to them...
@@AlgorithmswithAttitude thanks for doing it your explanation is second to none!
2:30 A true coder can relate. Thank you for the video.
Hi. Thanks you for putting so much effort into your videos :) I have over 15+ years of experience, working in top companies, watched and read tons of material. And your way of presenting is my favorite :) I understand that majority comes from Cormen but your presentation soooo simplier, condense and fun to watch!!!
Thanks. I wish I could put them out more quickly, but they take me a while to make.
This is such a smart algorithm
great video. Hope you are no longer so lonely.
I is fine.
This is incredible- thank you for explaining it! Also, 2:31 LOL
This explanation was fantastic, the part on topological sort and DFS made Kosaraju's algorithm click for me. Thank you!
It took me a while to get a good intuition for dfs topsort, but that gave me a much better understanding for this one.
Bless your beautiful soul
very nice. love the longer videos
Thank you for a wonderful explanation! :) It really helped me develop an intuition behind this algorithm, which is what I've been missing.
It took me a long time to get the intuition behind DFS topsort. I could prove it worked, but didn't have the intuition. When that finally came, this one was a byproduct. I stopped a previous version of this video I was making, and waited until I had time to go back and remake that one before finishing this one.
If someone is struggling to understand this watch it twice without skipping. You will learn concept for your entire life.
Thanks for it. I was stuck and confused on first step of Kosaraju algorithm, thinking of "why do we need to perform DFS first and find the finishing time for each node ? Just reverse the edges and now perform DFS".
But, later reached here, and got to know for the "EFFICIENCY" ?
thnks you got a life time susbcriber please keep up the good work
Why did you choose to make a video about Kosaraju's Algorithm and not Tarjan's? Which do you prefer and why?
I use Cormen's book the most, so I am most familiar with this one. Also, I feel like I had a good intuition of why it works. Finally, without the intuition, I think it is really surprising that stringing together 3 simple algorithms seems to give an answer for a seemingly unrelated problem.
I might make one for Tarjan's approach someday, but isn't too close to the top of my queue right now.
You videos are great! My question is: how do you achieve the animation effects in the presentation? I suppose you use Latex Beamer.
The animations are svg in javascript. I would like to make some interactive exercises with them, but it would take even more time than the videos, and I don't know exactly what demand there would be for them.
02:33 I(am)... is very... very lonely(jk lol) Awesome explanation