Connected and Strongly Connected Components in a Graph

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.

[@adminuser1578]

greak work, your tree and graph playlist are true gems.

[@tamannatasnim4929]

So nicely described 🥰 Everything about components of graph became clear in just 12 mins. Love from Bangladesh ❤️

[@ridhimachauhan4962]

Thank you for all your videos. They are incredibly well made and provide lots of information in a concise manner.

[@jamespringle8413]

Very good video, clear and concise with plenty of good examples.

[@nackyding]

Thanks going over all of your graph material now. Thank you so much.

[@chrismwale9968]

Thanks, your explanations are clear and easier to follow.

[@Inspiring_travel_memories]

Good to see you mate! Really loved your work

[@AmitShrigondekar]

Thank you sir Appreciate your detailed lectures !

[@ramankr0022]

very helpful and extremely helpful examples given. very clear explanation.

[@SUMMedia]

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... :)

[@TheFlukeDude]

great explanation made this very intuitive to understand.

[@ManishTiwari-or8zt]

We are waiting for your videos to come as much as possible

[@beinggeet5890]

Thank you Sir ...So nicely explained in just 12 minutes

[@joycethomas6234]

great work sir, please upload videos on hashing problems also sir

[@fatimapatel6445]

Hello sir, really very good explanations way, I like it

[@madhavisharma8295]

Thanks for your videos, can you pls make a playlist of geometric algorithms.

[@RahulVerma-nu2bt]

Apka padhane ka style dil chuu gya bhaiya ❣️abb sb kuch samaj aa raha

[@ashikacharya]

Very helpful video. Was finding it hard to understand while studying discrete maths. Many many thanks from Canada.

[@vonage_sasb9356]

Hi Sir, Your videos and the way you explain are very useful. Can you please post a video on Dijkstra's Algorithm. Thanks.

[@divvia-ot9py]

thank you. your explanation is very clear 👌

[@anirudhvalsan2632]

Thank you sir for explaining this in a very understandable way

[@sumathik5180]

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???

[@45_ritiksharma32]

Your lectures are really helpfull

[@PetBuddies]

Thank you So Much... Really clear explaination

[@edoardogribaldo1058]

thank you very much for the explanation sir!

[@ahmedouyahya]

Hello there, thank you so much for this helpful video. Would you please make a video explaining " 953. Verifying an Alien Dictionary " leetcode problem.

[@mrm4691]

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.

[@rounakverma3909]

Thank you so much sir..!

[@biranchinarayanpadhi9067]

After a long long time man!!!

[@robertmk01]

Amazing :) Thanks so much.

[@suhanikashyap839]

Helpful, thank you! :)

[@vivek4n2u]

Please create a playlist for graph algorithms also nowhere i see content for this

[@ManishTiwari-or8zt]

Sir please keep uploading more videos

[@harinitharini6741]

Good explained sir

[@pravinmed]

I have one question, on how to draw n vertex'd star

[@thundertech4025]

Thank you soo much sir❤️

[@ridimamittal4064]

thank you so much, sir !!

[@godk1664]

Nice teaching 🥰

[@musratshaheen2946]

Best 👍 explanation

[@abdouguemmar9643]

this man is the GOAT

[@roshanrajkumar7827]

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

[@vr4306]

Do not stop making videos bro

[@rajaryan7566]

great sir

[@muntahariaz4332]

Nice 👌👌

[@rahulagarwal8059]

Sir plss ek video inpr banao plzzz
1.Painters parttion problem 2.aggressive cow problem pr banao
3.kadanes problem

[@prernasingh564]

Thanks a ton sir!

[@Madhu935]

Thank you so much ❤

[@kundrapumanju1969]

explained well

[@saharavo8819]

Thank you!

[@aakashgoswami8895]

Sir please flattening of linked list ka program explain kar dijiye

[@sapy4124]

But why are they called "strongly connected" components? Aisehi??? they are just separate components.... so why to call them strongly connected?

[@thundertech4025]

Crystal clear concept 😍

[@abdikafarbedel5641]

Please do how to reverse array

[@nojoodal-ghamdi5579]

Thank you sooooo much

[@swaraj.jagdale]

Thakyou Sir

[@kavishkanilan9137]

nice!

[@naziakhan4433]

Uordu lecture

[@45_ritiksharma32]

Plz make more and more vidios

[@ankitbhai7222]

Hey !

[@PetBuddies]

Where is the coding video????

[@sscaspirant00001]

oo angreg ruk ja

[@nabeelamasroor9441]

What is this behaviour!!!!!!!!! WHERE IS WEAKLY CONNECTED COMPONENTS. AADHA ADHOORS GYAAN DETE HO BEGHAIRATON