Tarjans Strongly Connected Components algorithm source code | Graph Theory

Tarjan's strongly connected components (SCC) algorithm
Explanation: • Tarjan's Strongly Conn...
Source code: • Tarjans Strongly Conne...
Algorithms repository:
github.com/wil...
Slides:
github.com/wil...
My website:
www.williamfise...
===================================
Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: amzn.to/3cvMof5
A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: amzn.to/3wC2nix

[@subhadippanja3702]

Your videos are excellent. Nice explanation

[@yuriyanisimov4482]

Amazing explanation as always William - thanks a lot for your videos! I think you don't need a stack though you can leverage recursion stack to return a rank...

[@likeyou3317]

Damn man I was cracking my brains on tarjan alg, trying to do it with few while loops and then when I saw u doing recursion I was lika "man, thats pretty smart" xD. I've done my graph "engine" kinda diffrently with a class Node with fields onStack, low, id, visited and class edge with start, end nodes etc. and after 2 hours of thinking why my tarjan didn't work I found out that there was no node.visited=true when u actually visit a node. Dunno how u solved it but i don't any of that being covered here :o

[@pyduper8433]

how to print the nodes in each scc? I'm not familiar with java

[@Digital_Renaissance81]

What IDE(text editor) Do you use? looks amazing

[@WilliamFiset-videos]

Ricardo Gonzalez sublime text