[Mean Stack Development] Topological Sort & Strongly Connected Components



[Mean Stack Development] Topological Sort & Strongly Connected Components.
A brief explanation of the topological sorting and a walk-through of finding out strongly connected components [which is an application of DFS traversal].

Please subscribe and give a thumbs up if you want more CS tutorials like this! 🙂

DFS Link:
SUBSCRIBE for more videos!

Be the first to comment

Leave a Reply

Your email address will not be published.


*