BFS Traversal in Graph | DFS Traversal in Graph

[@pranaypaul6361]

Your lecture is like DFS...go core and core until nothing left to explore. Amazing clarify on build blocks of everything!!

[@sumitvishwakarma1075]

Bhaiya providing every knowledge of DSA totally free which you can't also get in high paid DSA courses Hats off to you Bhaiya😇😇❤❤

[@dealseasy363]

Lecture Before Breakfast... As always Well Explained.👍

[@hiteshsharma5034]

🎉🎉🎉🎉 Missing your lectures due to exams🥲 restarting soon

[@OK-ku8ez]

DFS traversal using stack : DS used : 1) Stack for storing the nodes to be explored 2) Vector for storing next indexes to be explored (Also for checking visited or unvisited node) vector dfsOfGraph(int V, vector adj[]) { vectorans; vectorexploreIndex(V,-1); stackst; ans.push_back(0); exploreIndex[0]=0; st.push(0); while(!st.empty()) { //take out the node int node=st.top(); //take out the index for exploration int j=exploreIndex[node]; //explore while(j

[@newglobal7271]

This is the best course i can say , Thank You Rohit Bhaiya ❤❤❤🙏🙏🙏

[@vivek-he5ry]

day 3/60 ✅ Excellent Explanation Bhaiya... example of corona was really helpful. 😀

[@nidhiraj9686]

Bfs,dfs travelsal of graph done ✅✅ nice explanation bhaiya. Boht easily samaj aa gya sab kuch ❤❤

[@kamleshregar5880]

bro your lecture on graph is very good .i always fear from 3 topics tree,graph and DP ,but after watching your lectures on tree and now graph i am able to understand tree and graph in a good way and able to solve problems. thank you Bhai for your lectures.

[@SARDARAFNANAFZAL]

Brother your teaching method is amazing .thank you brother ❤😍.

[@pavanyadav3092]

the most underrated teacher on youtube.

[@bepositive.29]

Yes brother

[@surajadhikari.]

Thank you bhaiya for this incredible content and also mentioning Nepal in DFS. I am from Nepal and following you from couples of month. Thank you from bottom of my heart for amazing content.

[@Alokankit627]

Loving your graphs series, sir please try to add many problems into this playlist 🙏🙏, thanku so much sir for providing such a quality content consistently

[@yashwanth4120]

bhaiya aap kithna achha padate hoo... So that no confusion is left after the video. thank you so much for the efforts.

[@KashafZia-d7p]

oh what a mindblowing explanation....Hats off sir

[@zafrul_islam]

maja aa gya bhaiya (corona and travelling wala concept )👌👌👌

[@DeepakKallal-ds1xn]

Thanku sir apne kafi aache se samjhya collage Wale tho hawa main samjha dete hai sab. Meri presentation hai iss topic par tho esi trike se main unko chamka dunga thanku sir ❤👍😊

[@vaibhav2831]

19:40 coorect me if i am wrong is it bsf somewhat si,ilar to level order treversal from tree

[@anupammishra6514]

Best explanation bhaiya ❤❤🎉🎉🎉🎉🎉

[@anshyoutuber1608]

Best Part of Real life Example ❤❤❤

[@Codewithkumar-gc1kr]

best video for BFS and DFS

[@heetpatel3037]

Jai shree Ram ❤️ Bhaiya ek dum OP lecture AAPSE EK DIN ZARUR MILNA HAI

[@Sanataniblood-mb5pu]

Your efforts are Unbelievable bhaiya thank for providing such best content to us ❤❤

[@Swiftie03]

Great explanation ❤

[@kishan4735]

You lecture given good understanding as well as thinking ability it help to improve me

[@vivekpaliwal1876]

Linklist b to use kr skte hai adjacent list me....bs pointer change kr k remove ho jaega node

[@Historyfact-fo8zf]

Sir trie par video kab lekar avoge

[@deepanshumohan6182]

Thanks for the great lecture @coderarmy #RohitNegi. Watching this at midnight. Really great efforts.

[@arunnishad7733]

Thank you!!!, very good explanation , I have been suffering from understanding the bfs and dfs traversals till date but now it's all clear

[@ManojSinghRawat-x2w]

chamak chuka hai bhaiya😊

[@AdityaSharma-vd7bo]

Bhaiya iss janam mein toh ho gaya was good😂😂😂😂 42:04

[@Pixelofficialmohit]

Thank you bhaiya ji ❤

[@ankushladani496]

Bhaiya same algorithm 2 queue ki help se implement kar sakte hai kya?

[@monikumarbiswas-c7e]

thanks a lot vaiya .. waiting for this video . love from Bangladesh ..🥰🥰

[@imran3509]

maja aaya ,rohit ji kya gate aur dsa prep saath mein ho sakti hai ? currently in 5th sem i want to score good in gate 2025 but placement ka bhi dar lagta hai

[@divyanshsharma673]

Amazing content as always 🔥🔥🔥

[@pawankr.6273]

Day - 03/60 #60DaysOfCode DSA++

[@sdtedit5165]

bhaiya ham chahte hai ki aap hame C++ DSA se ek bada project bhi banvana jisme sare concept use ho or bahut kuch sikhne ko mile kyuki KZbin par c++ dsa ke achhe project nahi please bhaiya ..

[@joydeep-halder]

H/W Solution for dfs using stack: vector dfsOfGraph(int V, vector adj[]) { vector ans; vector visited(V, 0); stack st; st.push(0); int node; while(!st.empty()){ node = st.top(); st.pop(); if(!visited[node]){ // Handles the cyclic graph ans.push_back(node); visited[node] = 1; } // Traversing from right to left so that // the leftmost node gets popped out first for(int j=adj[node].size() -1 ; j>=0 ; --j){ if(!visited[adj[node][j]]){ st.push(adj[node][j]); } } } return ans; }

[@rejaulislam2593]

chamak gaya sir j alhamdulillah

[@ChukuKumar-bj5ni]

bhaiya can we traverse singly linked list

[@YashNegi-qr6ze]

nice lecture ❤

[@utkarshsingh09]

All concepts clear!!

[@ThepokeSUST]

what if ,when graph is not connected, then how to do traverse

[@souravjyoti64]

correct

[@gautamkumarverma2929]

please Discuss Time complexity as well,Bhaiya 😃

[@nanumix3167]

note: 41:22

[@chanchalsoni7535]

consider urself damn lucky...if u r studying from this person..😌💓

[@joshiarmy123]

Nice lecture

[@bharatmalik2756]

Chamak Gya Bhaiya 🔥🔥

[@rashisahu8511]

Amazing explanation

[@sauravdhar1696]

Bhaiya graphs ke approx kitne lectures honge?

[@dawooddawoodahmad6521]

sir i am waiting for your prims and kruskal algorithm lecture please

[@JatinGupta-k8n]

Bhaiya please upload shortest path ,dp and greedy series

[@swatiyadav3388]

Bhaiya the code for BFS will not work for disconnected graph ........?

[@CoderArmy9]

Ye code srf connected graph pe work karega, aage ke lecture mein sab cover kiya hai, don’t worry 💙

[@sayanacharyya250]

Chamak Gaya bhaiyaa ❤

[@karankumar3983]

Thanks bhaiya Puri feel aa gayi ❤

[@ShreeRamSingh-vl9tl]

54:02 Watching from Nepal♥

[@MaheshwariLakde]

03/60 completed thanks bhaiya..!!

[@allinonemoviesyt]

58:59 Homework : vector dfsOfGraph(int V, vector adj[]) { vector ans; vector visited(V,0); stack st; st.push(0); while(!st.empty()){ int vertex = st.top(); st.pop(); if(!visited[vertex]) ans.push_back(vertex); visited[vertex] = true; for(int i=adj[vertex].size()-1; i>=0; i--){ if(!visited[adj[vertex][i]]){ st.push(adj[vertex][i]); } } } return ans; }

[@Rahul-cn8bq]

nice explanation

[@OnlyPc-c9n]

maza aa gaya bhaiya

[@shekharsingh2915]

chamak gya bhaiya

[@Gyanendra012]

Corona op🔥😂 3:42

[@bepositive.29]

Better than code help

[@ankushladani496]

Thanks Bhaiya...🚀💪

[@siddharthall-in-one3282]

Are these 60days only on Graph Or any other topic also??

[@nidhiraj9686]

Dp also

[@Jv_Singh37]

add time stamp plz 😊🎉

[@SandeepKumar-uk4kt]

Homework: vector dfsOfGraph(int V, vector adj[]) { vector visited(V,0); vector ans; stack st; visited[0]=1; st.push(make_pair(0,0)); ans.push_back(0); while(!st.empty()) { int vertex,index; vertex=st.top().first; index=st.top().second; if(index==adj[vertex].size()) st.pop(); else if(!visited[adj[vertex][index]]) { visited[adj[vertex][index]]=1; st.push(make_pair(adj[vertex][index],0)); ans.push_back(adj[vertex][index]); } else { index++; st.pop(); st.push(make_pair(vertex,index)); } } return ans; }

[@seekingsoul871]

Bhaiya, I really want your mentorship. Could you help me bhaiya?

[@AbhishekKumar-lp7wy]

Good morning bhaiya ❤

[@allinonemoviesyt]

[@letsk9188]

pura lecture hi mast tha

[@ujjwal02]

Day 3/60✔

[@Ramgangakumar]

sir corona virus ka example nhi lena chahiye tha 😢😢

[@Nebula_official_25]

Good morning🌞🌞 bhaiya

[@seekingsoul871]

Bhaiya Maja aa gaya.

[@itshirdeshk]

Day 199 ✅🔥

[@JASHANPREETSINGH-wx7du]

chaa gye sir

[@machinecode2.047]

Good morning sir 🌅

[@uttej1390]

12:00 level sab ke niklenge🤣🤣😅

[@Harshmishra0007]

Ram ram bahi❤

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@shubhamkumarjha9192]

Good morning boss...

[@yatindanger]

Day 03/60 completed #60DaysOfCode

[@Code_with_Tiwarijii]

Chamak gya bhaiya

[@ishitamaithani1207]

Bhaiya day 4 ki video😌

[@sharadjishukla3297]

Day 3 Done ✅

[@bishalpaul18]

Bhai m 2- 3 video dekh chuka hu bfs ka lekin aaj tak samajh nhi aaya ,yaha par bhaiya corona virus ka example deke samjha diye ab kabhi nhi bhulunga😊

[@Kirito_kirigaya13_11]

Thanku bhaiay❤

[@jitDhank04]

Day 3 🔥🔥

[@simisimi9362]

thank you bhaiya

[@kartikay0111]

kal exam hai aur aaj apke video ne bacha liya

[@OK-ku8ez]

Can anyone tell me the error in my code. Please! //We will use two stacks //1st one for storing node(vertex) //2nd one for storing index from where next time unvisited nodes will be checked stacknode; stackindex; //Prevent iteration to begin from start vectorvisited(V,0); vectorans; //Starting from 0th node node.push(0); index.push(0); visited[0]=1; ans.push_back(0); while(!node.empty()) { int j=index.top(); for(; j

[@yashparashar6781]

Day 03 ✌

[@YashSaini007]

Day - 03/60 #60DaysOfCode

[@satyam6943]

Exam se ghatiya chiz kuch nhi jab bhi consistently Karo usi samay exam aake consistency bigad deta hai😡😡

[@internetuser_1]

Same 😢

[@Vardanaggarwal]

concept ++

[@monikumarbiswas-c7e]

vaiya , please write code without class ,. love from bangladesh

[@Historyfact-fo8zf]

Sir ase Tu maja nai ayga apke video ka इंतजार karte karte Tu बहुत देर हो जाएगी so please consistency sir

[@CoderArmy9]

Bro video mon-fri aaygi, btya th video mein

[@Historyfact-fo8zf]

@@CoderArmy9 thanks for reply bro you are great ❤❤❤

[@SubhashKumar76-x8g]

03/60 dsa++

[@kartikay0111]

Maja aa gaya