How to find Connected Components and Cycle in a Graph using DFS | CP Course | EP 71

[@sahilanand30]

Luv Sir -> King of CP 👑

[@manojgollapelli9856]

everyone else explain just code,
but u explain the approach to write the code. Thanks a lot💛💛

[@shubhampatel7622]

Always felt ghosted by graphs, but your explanation is so simple and easy, i am getting some confidence in graphs now. Really excited for future videos. Thanks a lot💛

[@varshagoyal9574]

Literally I learned a lots from you 🧡

[@jayadubey_22]

You explained as we solve the question🙌💛

[@Yuvraj20011]

Luv bhai aap best teacher ho mujhe Graph ka kuch bhi samajh nhi aata tha, Now I love graph and its problems and ab problems bhi samajh aa rhi hain DFS related and please Trees ka bhi kuch kro

[@deveshkumarjaiswal5224]

Never thought graph could be this easy to code 💛🔥🔥🔥🔥

[@aayushthomas]

aap dfs itna acha padhai ki ye aap batane ke pehle hi solve hogaya

[@omkarkawatgi]

watching every single video you made !!! Thank you !😄

[@e.m.hasanprince4609]

bro i think u should make a video on how to traverse a 2d graph and find some path with dfs. this topic seems quite hard for us.

[@Dev77g]

Bhaiya kasam se bohot maza aa rha hai ab padhne mein thank you very much bhaiya ho sake toh wapas se youtube pe active ho jao aur hume aur chize sikhao. 💛

[@asmitsingh1480]

luv ur videos bro cant wait to learn a whole lot of cp from u

[@harshgautam4716]

Hey, luv ❤ you are doing great job. One of my suggestion is please include more questions in video which was asked in coding test rather then in interveiw. ✌✌

[@kunalhaldiya9291]

you are best teacher sir

[@sippy8482]

Congrates for 90k

[@gouravkumarshaw5467]

Great Explanation Thank you !!💛

[@manojbhat1440]

Thank you so much bro your channel is underrated.

[@lavishpalia9286]

💛 Learning a lot bhaiya 💛

[@nimeshsingh6229]

Aag lga di bhai 🔥

[@kvs1567]

Very impressive teaching style. Thanks!!💛

[@good114]

Thank you Bhaiya ❤️💕

[@urparvezali]

brother you are awesome for me. I learned lot of from you.

[@aashitAgrawal]

you made it look so easy
💛💛

[@nawabkhan4916]

Great video 💛

[@Shakil.oxalet]

take love from BD

[@priyeshtandel2101]

💛Thank you so much

[@VinodKumar-bz9mg]

Bro - You are giving great and easy explanation. I wanted to refer it to few of my US follows but they cannot understand Hindi :(. I would urge you to prepare them in english as well. Excellet teaching!

[@Zylargames]

Us wale logo ko bolo Hindi me videos banaye pehle kyuki Hume English ni aati acche se samajh

[@Manish_Sahu]

cout

[@pavankothapally8150]

thank you so much ...i just found the perfect playlist

[@Red___Beast]

great lecture

[@pragatsharma1580]

Bhaiya how to find size of graph in the code for graph that you have written?

[@divyansh2212]

thanks for this amazing content.💛

[@AkashKumar-ls7hg]

After watching this amazing video on DFS how easily you explain step by step i can't control myself for subscribe your channel for such amazing video .superb 💛*💯

[@abhaypratap9898]

Love you bhaiya 💗

[@malkeetsapien4852]

Thanks Man !!! 🐺

[@aishwaryalakshmi1415]

Thanks bhaiya💜 crystal clear😁

[@wolfrikz7238]

This is amazing ❤️

[@e.m.hasanprince4609]

U are really genius bro.

[@amitbajpai6265]

Bhai Meri job abhi shuru Hui hai.... Lakin Mai satisfied nhi hu to aur prepare kar RHA hu 10 din sai ds dekhna bnd Kar rakha tha aaj Kunal aur striver ka mic drop challenge dekh Kar aaya aur ab apka graph series dekh rha hu

[@sukhmanpreetsinghsandhub2042]

awesome video as always :).

[@himalikhandelwal1346]

By when will the whole cp course be finished?

[@tanujbhattdotin]

where you updated the parent...?

[@maddycoder1294]

[@GANESHSINGH-oe2wy]

Sir aap konsa softwate use krte ho highlight krne ke liye jo apne aap highlight hone ke baad mit jata h

[@vivekvatsalya8836]

loved this video

[@AvinSrivastava-he8rj]

If we do not use isLoopExists|=dfs(child,vertex) what will happen for return value??

[@jaykumarpatel6392]

Thanks a lot💛

[@DHEERAJKUMAR-sb7dt]

part 1
#include
using namespace std;
const int N=1e5+10;
vectorg[N];
vector cc;
vector current_cc;
bool vis[N];
void dfs(int vertex)
{
/*Take action after entering the vertex*/
//cout

[@mahdi-hasan]

Can you show for directed graph?

[@shreyasharma1625]

Amazing 💛💛

[@freeandreliablejeeprep820]

thank you very much sir

[@shivamkumarshaw4378]

Thanks !💛💛

[@Super-lj1rf]

thanks💛💛

[@NatureTechNexus]

hello bro i've doubt we can ignore that isloopexists variable since we are already returning true when we find loop so at that point it directly jump out of that function. please correct me if I'm wrong

[@soumya1713]

sir i love your videos , sir please cover other graph algo like topological sort,.....

[@sahilanand30]

Best

[@chiraggoyal9646]

Thanx bhaiya

[@gauravdhakad796]

''yellow heart with little blood and full of luv"

[@cricbollysci6191]

sir , please code bhi upload kar diya karo ..
usse hame kafi help milti hai 🙏🙏🙏🙏🙏🙏🙏🙏🙏

[@iamluv]

i don’t do it intentionally because otherwise people will just copy paste from there, i want people to write themselves

[@ru2979]

@@iamluv ❤️

[@unknown_coder7960]

Bhaiya 390 questions ho gaye Leetcode p...ab koi chance h Elon Musk ko harane ka🙄

[@HemantBEE]

bas thoda sa or :)

[@unknown_coder7960]

@@HemantBEE aap bolte ho to aisa hi hoga 🙂

[@sushanthgupta626]

bhia segment tree bhi padaoge kya?

[@sasageyo9571]

If 0 is a node, then shouldnt the parent of the first node ( on which we apply dfs ) be anything other than 0 ?

[@vampzzz]

Should be something that is not present in the given vertices
Like preferably -1 if all the vertices are positive.

[@satanshuag]

Thankyou !!!!!

[@Ak-kc7qp]

Bhaiya bahut din se contest organise nai kiye...contest4 organise kab kar rehe ho?

[@iamluv]

yaar mushkil hai. i dot have time to make a contest, nor anyone who can help in making contest

[@Ak-kc7qp]

@@iamluv okay bhaiya I get it...graphs and trees ke baad overall ek contest kardena...
Bdw love your videos😄

[@chemistryman6053]

Why did the loop runs from 1 to n?

[@RoniBadgujjar]

Because bro we are checking if that node is visited then we have no need to traverse that component

[@mohammedsaquib4806]

thanks bro

[@53_manishkumar_it54]

STL PURA COMPLETE HO GYA HAI KYA ?

[@mitanshu2011]

Haan bro

[@53_manishkumar_it54]

@@mitanshu2011 achha tq bro

[@samagrapathak3854]

Maza aaya

[@_ayush_oswal]

bhaiya ek baar how to find number of cycles in a graph batado😭😭 💛💛💛💛

[@youtubeuserlovesyoutube2207]

code should also include the case where graph is not connected and hence we will combine the previous code in the same video

[@iamdj8540]

💛
are u reading my comment 😅

[@SajanKumar-ec2us]

please cycle detection of directed graph

[@pulkitmittal584]

💛

[@muhammadjobayer5206]

💞💛💛💛💛💛💛💛💛💛💛💛💛💛

[@mahdi-hasan]

In the title, it should be mentioned that it's for an Undirected Graph.

[@abhaynegi3930]

yellow heart

[@mangeshtrimbake3170]

❤️

[@mdiewachrist7196]

nice'

[@rishumittal4548]

💛💛💛

[@AmanKumarSinhaOfficial]

❤❤❤❤❤

[@prernasinghchauhan3002]

#include
using namespace std;
const int N=1e3;
vector graph[N];
bool visited[N];
bool dfs(int vertex,int parent){
visited[vertex]=true;
bool isloopexist=false;
for(auto child:graph[vertex]){
if((visited[child]) && (child==vertex))continue;// check for self-loop
if(visited[child]) return true;
isloopexist |= dfs(child,vertex);
}
return isloopexist;
}
int main(){
int n,m;
cin>>n>>m;
while(m--){
int v1,v2;
cin>>v1>>v2;
graph[v1].push_back(v2);
graph[v2].push_back(v1);
}
bool cycle=false;
for(int i=1;i

[@farzzziii]

💛💛💛💛💛

[@ravigola2354]

💛💛💛💛💛💛

[@noContext314]

💛💛💛💛💛💛💛💛💛💛

[@funenjoynilaypatel4553]

8-aug 2022

[@KUMARSAURABH-s5i]

thanks a lot💛

[@tarunkumarreddy5020]

Thanks broo

[@kumarsunny4358]

💛

[@omkarharade5807]

💛💛💛💛

[@magamindplanet8930]

💛💛💛💛💛💛

[@dheeraj7385]

💛💛

[@devanarayanababu1996]

❤

[@Rishav_Raj17]

💛💛💛💛💛💛💛💛💛💛

[@subhasishpanda5390]

💛

[@codingbluff8828]

💛💛

[@soumavachakraborty9858]

💛💛💛💛💛

[@himanshurai485]

💛💛💛💛💛💛💛💛

[@MOHITKUMAR-gt4ju]

❤️💛

[@RahulKumar-pk7ht]

💛💛

[@piecesofpuri]

💛💛💛💛