Strongly Connected Components: Kosarajus Algorithm
Вставка
- Опубліковано 26 сер 2024
- Get COURSES For FREE Using This Scholarship Test. Register Here Now: www.codingninj... In this video, you will learn an interesting concept of strongly connected components.
0:30 Logic behind Strongly connected components.
3:33 Kosaraju's Algorithm.
7:45 : Do DFS store vertices as per their finish time.?
13:05 Graph of strongly connected components.
13:17 Concept of a directed cycle.
15:43 Different Conditions in Strongly connected components.
----------------------------------------------------------------------------------------------------------
Join our Coding Ninjas official telegram community here: t.me/codingnin...
-----------------------------------------------------------------------
Coding Ninjas is one of the leading EdTech company providing India’s Highest rated programming courses in C++, Data Structures and Algorithms, Java, Python, Machine Learning, web development, Data Science, Android Development, Kotlin, React.
To explore our courses, click here: bit.ly/2WWmdE1
To explore our Free Trial Courses click here: bit.ly/2YqUL1Y
-----------------------------------------------------
To watch more exciting videos on programming, subscribe to our channel here: bit.ly/36n3g08
------------------------------------------------------
Explore more on our social media platforms:
Facebook: / codingninjas
Instagram: / coding.ninjas
Linkedin: / 1319…
Register for Coding Ninjas Scholarship Programme:
bit.ly/CNSCHOLARSHIP
If we use queue in place of stack and didn't reverse the connections
Is it work ??
Is it important for interview @coding ninja
BEST EXPLATION ON UA-cam , HANDS DOWN AFTER 11:00 IS JUST BEAUTY .
Thanks a lot sir this is was the best explanation of the intuition behind the algorithm i have ever seen 🙏
Thank you for the kind words! We hope that this video has helped you!
Stay tuned to Coding Ninjas UA-cam channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home?
If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library?
If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?
Very good explanation
Sir the final component will be [abci] 10:12
Your explanation for this is stunning! Probably one of the best on the Internet.
Oh, and Kosaraju, btw, is an Indian. ;)
sir, can we do reverting of the stack instead of transposing the graph?
The best explanation compared to any platform. Coding Ninjas has made every algorithm look extremely simple from their way of simplifying and explaining it. Thanks Coding Ninjas!! I would recommend taking their course as a part of Summer Training or mastering DSA though I haven't taken it but from their explanations, the way of teaching. Best of Luck team!!
Thanks Satyam!
sir your teaching method is too too too awesome
Amazing explanation sir, really helpful :)
God level solution.
+ God Level Explanation
Only feedback sir, I think if you explain by using only english language, it will be more useful for many people and easier to understand, sir
Such Nice Explanation. Thanks
great explaination..thanks a lot sir
Thank you for the kind words! We hope that this video has helped you!
Stay tuned to Coding Ninjas UA-cam channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home?
If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library?
If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?
which device are you using to write??? plz tell... i am working on a similar project ... it would be really helpful if you tell me.
v good explaining technique
❤❤❤❤
Your Explanation is superb :)
Best intuition for SCC via Kosaraju :)
Awesome !!
for coding part-
ide.geeksforgeeks.org/nwSx5vfegW
Sir a,b,c,i will be in one component but i is at the bottom of stack...how to pop it before other vertices on top of it
no need to pop it before maintain a boolean visited array , then pop each vertices one by one if not visited then dfs ,mark visited on all of verticies you visit and if a top node on stack is already visited then pop it without doing any thing
great explanation
thanks a lot
Sir,at 9:53, whether abcd will be deleted from the stack, or abci.
Thank u sir!
Thanks Sir
How can we return the number of vertices in each strongly connected component ?
What if we do bfs as a traversal on original graph ??
where is the coding part link? can any one help
this might help you-
ide.geeksforgeeks.org/nwSx5vfegW
Join our Coding Ninjas official telegram community here:
t.me/codingninjas_official
in which course it has been taught? Competitive Or DS?
read description
Competitive
great explanation!!
Kosaraju
How text is overlapping on sirs hand🤔?
The video is titled and starts in english why r u switching to another language halfway through my guy
bhadiya
Thank you for explaining it so well :-)
Got Queries related to strongly connected components, Let us know in the comments section.
In this video, you will learn an interesting concept of strongly connected components.
0:30 Logic behind Strongly connected components.
3:33 Kosaraju's Algorithm.
7:45: Do DFS store vertices as per their finish time.?
13:05 Graph of strongly connected components.
13:17 Concept of a directed cycle.
15:43 Different Conditions in Strongly connected components
Is this video meant for hindi understanding viewers only?
Abci