Detect cycle in graph | Hello world Graph Playlist Easy | DFS Algorithms | Hindi Explained

[@uditsethi2578]

Today I completed this playlist that i started 2 days back and I can't believe that seems to me very hard earlier is now feels to me like a normal hello world program and after I completed your BFS video starting from 1 video of playlist, after BFS i done all the question by myself without playing your video first ....Thanks alot May god bless you and wish this channel will be counted under the best education channels especially for CS engineers in upcoming 3 years.

[@HelloWorldbyprince]

Thanks udit bhai ...such a great motivation for me

[@ankitaaaaaaa25]

Thank you so much, I was really scared to solve graph problems earlier, but now I am able to understand it and also solve them by myself.

[@ayushhh2257]

Bhiya aap bhot shi tareeke se samjhate ho👍👍

[@HelloWorldbyprince]

😊😊 bass share karo do channel

[@oqant0424]

yes bhaiya maine ek ek function ko chaala chala ke dekha....literally clear ho gaya sab

[@HelloWorldbyprince]

waoo yaar aap sach me bhut hard working ho

[@oqant0424]

@@HelloWorldbyprince thank u so much bhaiya

[@rode_atharva]

bhai sach me easy bana diya yaar tumne

[@tusharnain6652]

The Best Graph Series, ❣️

[@HelloWorldbyprince]

Thanks bhai

[@gokulnaathb2627]

Thank you bhaiya, nice explanation

[@shivanshsharma399]

you are making really great videos bro 👏👏

[@HelloWorldbyprince]

Thanks a lot shivansh 🤩

[@akshittomar2401]

Brother Question of LeetCode #207 Course Schedule , belongs to the concept of detecting a cycle in Directed Graph we can't do it using Non-Directed Graph .

[@LOVE-kf9xi]

wahi toh , mai chutiya zabardasti dekh rha hu galti kaha hai .

[@pranavkorhale5089]

//my logic instead of tracking parent I use hashset to save the visited edge //if vertex is already visited but edge to that vertex not in hashiset then graph contains cycle //for more idea JAVA Code class Solution { // Function to detect cycle in an undirected graph. public boolean ans = false; public boolean isCycle(int V, ArrayList adj) { ans = false; HashSet hs = new HashSet(); boolean []visited = new boolean[V]; for(int i=0;i

[@HelloWorldbyprince]

Yeah u can do this as well nice 👍

[@Thescienceworld652]

balle balle ho gya 😁😁

[@HelloWorldbyprince]

Wahhh yaar good job

[@ankitkumarsingh8346]

Brilliant explanation

[@HelloWorldbyprince]

Glad you think so!

[@palashmalu6278]

sir aap best ho !! also cp wala course enough hai ti get stated ??

[@amanpandey4550]

Cpp Code - bool DFS(vector adj[], vector&vis, int source, int parent){ vis[source]=true; for(int x : adj[source]){ if(vis[x]==false){ if(DFS(adj,vis,x,source)) return true; } else if(x!=parent) return true; } return false; } bool isCycle(int v, vector adj[]) { // Code here vector vis(v+1,false); for(int i=0; i

[@HelloWorldbyprince]

Amazing yaar , keep learning

[@easylearning6647]

thank you for your efforts

[@HelloWorldbyprince]

It's my pleasure

[@yourshawonn]

Sir please upload krushkal algorithm class

[@HelloWorldbyprince]

sure i will

[@goyaldeekshant]

not able to do that course schedule leetcode problem:

[@VaibhavSutar-xm3cn]

class Solution { // Function to detect cycle in an undirected graph. dfs(current,parent,visited,adj,map){ if(visited[current] && map[parent] !== current) return 1 visited[current] =true let adjacent = adj[current] if(adjacent){ for(let i=0;i

[@compc_59_manishyadav77]

I want to know where is parent updating , like initially we have assigned -1 as parent , so are we upadating it some where , nahi to it will keep parents as -1, if I am wrong please do correct me @ anyone!!!

[@HelloWorldbyprince]

yes u r on the right way of learning bus please ek baar code ko dry run karke dekho sach me mazaa aa jayega kissi v ek example ko aache se copy pen me write down kijiye

[@PIYUSH-lz1zq]

👌weighted graph ke kuch karva do

[@HelloWorldbyprince]

Okay weighted graph ka v video banaa denge

[@adityanjr]

course schedule uses concept of cycle detection in Directed Graph...

[@HelloWorldbyprince]

Yo bro

[@VaibhavSutar-xm3cn]

at 5.55 krte he hum solve bhai wait

[@knowsbetter4113]

❤

[@HelloWorldbyprince]

👏 Thanks a ton

[@oqant0424]

at #4:09 i had also the same thought process.....i analysed on my own why it will be wrong....but i couldn't come up with solution

[@HelloWorldbyprince]

koi baat nahi dhere dhere kar lega bro tum

[@oqant0424]

11/32 done (5.11.22)

[@HelloWorldbyprince]

good

[@prabhatmishra5667]

Complete code - bool h(vector adj[],vector &v,int s,int p) { v[s] = true; for(auto x:adj[s]) { if(!v[x]) {if(h(adj,v,x,s)) return true;} else if( x!=p ) return true; } return false; } bool isCycle(int V, vector adj[]) { vector v(V,false); for(int i = 0; i < V; i++) { bool ans=false; if(!v[i]) ans=h(adj,v,i,-1); if(ans) return true; } return false; }

[@HelloWorldbyprince]

amazing bro

[@SunnyGupta00]

Bs bhai dsu pe video bana do

[@HelloWorldbyprince]

okay i will

[@rahulgautam6387]

Bhaiya isme jo question h uska solution nhi 41 test cases pass hue out of 51 and finally solution solve nhi ho pa rha h🥲

[@HelloWorldbyprince]

u can watch my solution as well

[@yashijain7447]

Playlist for Tree and DP plzz

[@HelloWorldbyprince]

sure

[@ShubhamKumar-ex3nk]

what if there is a self loop?

[@jayeshtak2530]

Doesn't work on Leetcode 207 ?

[@gauravkumar6632]

bhai how parent is increasing? you initialized parent=-1;

[@Coder_DhruvArora]

In recursive function calls, we are passing different parent for each call

[@VishalKumar-ce9pe]

-----------------------------------------------------------CODE----------------------------------------------------- class Solution { public: bool DFS(vector adj[], int u, vector& visited, int parent) { visited[u] = true; for(auto a: adj[u]) { if(visited[a] == false) { if(DFS(adj, a, visited, u)) return true; } else if(a!=parent) { return true; } } return false; } bool isCycle(int V, vector adj[]) { vector visited(V+1, false); for(int i = 0; i

[@HelloWorldbyprince]

amazing code bro nice

[@krushnapatil9196]

parent banane ka code konse line mein hai

[@cr7johnChan]

#include #include #define V 4 using namespace std; void edge(vectorgraph[],int i ,int j){ graph[i].push_back(j); graph[j].push_back(i); } int check(vectorgraph[],vector&visited,int j,int prev){ visited[j]=1; for(int i=0;i

[@HelloWorldbyprince]

nice buddy

[@SurajKumar-cj7md]

C++ CODE // Function to detect cycle in an undirected graph. bool DFSREC(int s, vector adj[],vector&visited,int parent) { visited[s]=true; for(int u:adj[s]) { if(visited[u]==false) { if(DFSREC(u,adj,visited,s)) return true; } else if(u!=parent) { return true; } } return false; } bool isCycle(int V, vector adj[]) { vectorvisited(V+1,false); for(int i=0;i

[@HelloWorldbyprince]

good job

[@newhorizonsaniket8650]

Bhaiya code is not working

[@newhorizonsaniket8650]

For v=4 e = 3 4 2 1 2 2 3

[@gokulnaathbaskar9808]

[@HelloWorldbyprince]

Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@lokendrayadav91]

bhai pura playlist taabadtod hai ,

[@HelloWorldbyprince]

Thanks bro for the support Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀