Connected and Strongly Connected Components in a Graph
ฝัง
- เผยแพร่เมื่อ 18 พ.ค. 2020
- We find Connected and Strongly Connected Components in a Graph. The connected component term is used for undirected graph and strongly connected component term is used for directed graph. This comes in the basics of Graph theory.
greak work, your tree and graph playlist are true gems.
Thanks going over all of your graph material now. Thank you so much.
So nicely described 🥰 Everything about components of graph became clear in just 12 mins. Love from Bangladesh ❤️
Good to see you mate! Really loved your work
Thank you for all your videos. They are incredibly well made and provide lots of information in a concise manner.
Very good video, clear and concise with plenty of good examples.
Thanks, your explanations are clear and easier to follow.
We are waiting for your videos to come as much as possible
very helpful and extremely helpful examples given. very clear explanation.
Thank you so much for the clear explanation video. I really liked the way you explained the concept through showing enough examples. Every teachers should show examples and explain it exactly like you did. Thanks a lot man... :)
Thank you sir Appreciate your detailed lectures !
Thank you Sir ...So nicely explained in just 12 minutes
great explanation made this very intuitive to understand.
Thanks for your videos, can you pls make a playlist of geometric algorithms.
Apka padhane ka style dil chuu gya bhaiya ❣️abb sb kuch samaj aa raha
Hello sir, really very good explanations way, I like it
Thank you So Much... Really clear explaination
After a long long time man!!!
great work sir, please upload videos on hashing problems also sir
Amazing :) Thanks so much.
Thank you sir for explaining this in a very understandable way
Very helpful video. Was finding it hard to understand while studying discrete maths. Many many thanks from Canada.
Helpful, thank you! :)
Hi Sir, ur videos are easy to understand....I have a question in a last directed graph...the vertex b,e,d has no path to the vertex a....then b,e,d are 3 different components right or wrong???
thank you so much, sir !!
Hi Sir, Your videos and the way you explain are very useful. Can you please post a video on Dijkstra's Algorithm. Thanks.
thank you very much for the explanation sir!
thank you. your explanation is very clear 👌
Thank you!
Thanks a ton sir!
Hello there, thank you so much for this helpful video. Would you please make a video explaining " 953. Verifying an Alien Dictionary " leetcode problem.
I have one question, on how to draw n vertex'd star
Please create a playlist for graph algorithms also nowhere i see content for this
Your lectures are really helpfull
can you do a video on weakly connected graph? I think your class is easy to understand. I tried lot many videos but its confusing.
Do not stop making videos bro
Thank you so much ❤
Sir please keep uploading more videos
this man is the GOAT
Nice teaching 🥰
Good explained sir
Sir I want a video on converting a DLL to a binary tree....plzzz do the needful .However you’ve done the reverse of it
Thank you so much sir..!
Thank you soo much sir❤️
Best 👍 explanation
great sir
Nice 👌👌
Thank you sooooo much
nice!
Sir plss ek video inpr banao plzzz
1.Painters parttion problem 2.aggressive cow problem pr banao
3.kadanes problem
Sir please flattening of linked list ka program explain kar dijiye
explained well
Please do how to reverse array
Thakyou Sir
Uordu lecture
But why are they called "strongly connected" components? Aisehi??? they are just separate components.... so why to call them strongly connected?
Plz make more and more vidios
Hey !
Crystal clear concept 😍
Where is the coding video????
Phli baar iss channel p aaya tha, dimag ka dahi kr diya sala kuch smj ni aaya
oo angreg ruk ja
What is this behaviour!!!!!!!!! WHERE IS WEAKLY CONNECTED COMPONENTS. AADHA ADHOORS GYAAN DETE HO BEGHAIRATON