Lecture 98: Bridges in a Graph || C++ Placement Series

[@rajat_singla]

We can avoid using vis[] array. If (disc[node] !=-1), it indicates that the node is visited. So we can use this condition instead.

[@jatingarg1897]

After a good series of topics, there comes a frustrating one. 😂

[@chiragPatel22c]

totally agreed!! mene do tin video dekhe but yaha aake samaj aya concept!

[@itsaayush7357]

Frustrating nahi h yar...ajeeb he he. Bhot he weird

[@muhammadsuleman8936]

Exactly.. @@itsaayush7357

[@CE073_lakshkyada]

Sahi kaha bhai puri series me 1 bhi topic aisa nahi thaa to hard laga Lekin isme thoda problem aa raha he 😂

[@vmstudy9965]

Sach me broh... G@*D ftt gyi bhai🥲

[@kishanprajapati3327]

Thanks Bhaiya to continuing DSA series i know it's hard to do lots of work and getting 2-3k views but still you are doing free for us. I have no complain why you have to started teaching on Unacademy.

[@sanyadoda6725]

14:00 is graph mein do bridges ho sakte hain , 0-3 bhi ek bridge ho sakta hai . kyunki low[neighbour] that is 3 >disc[node] which is 0. and 0-4 toh bhaiya ne bata hi diya

[@nishaanand6460]

saw other channels.. but so far.. this video made me understand this concept best!

[@varun_immadisetti]

Bhai, it took me around 2 hours to understand how exactly it is working. I have made dry run and finally understood this clearly. Thank you for this video.

[@Ballistic_Bytes]

Thoda mushkil hua samajhne mein but aakhir mein aa gaya samahj. Thanks a lot bhai.

[@sukhjitsingh959]

Babbar sir you are speaking very fast and then facing problem to understand some content while discussing approach..I visited vedio again...and again while discussing disc time and low possible time while updating when you found neck edge ...you are doing very well in all vedio thanks

[@prashantbirajdar9271]

haa bhai thoda fast vo gya aur concept bhi puri tarah samja nhi 80% samaj aya phir bhi code samaj ayaa thanku bhaiyaa

[@skchoudhary7956]

Consistency back on track👌...quality of content💯...Energy😐 dikh rha h load kaafi le rakha h....

[@sagarchaddha2637]

we can use timer-1 instead of desc array that will reduce space complexity.

[@sal2054]

But it would remain O(n) only :)

[@raghavjuneha148]

Why low[2] was updated to 0 and not to 1? I mean since the distance between 0 and 2 should be equaivaent to 1

[@mridul.7183]

when we checked for bridge condition for 0 and 3 we ignorred as 0 was parent of 3. then why didnt we ignore 3 and 4 where 3 is also parent of 4?

[@prayagpatel9136]

why dont we update low[node] with min(low[node],disc[neigh]+1)......bcz coming fro neighbour to node will require one unit time?

[@anuragpandey8165]

exactly....

[@skyquake._]

I was about to ask.

[@prabhatmishra5667]

Dry run it with examples. You seem to be confused here

[@avronilbanerjee5302]

kzbin.info/www/bejne/eaSqgZKplJh6jck Watch this

[@pareekshithachar3788]

did you understand why> even im confused

[@VishalGupta-xw2rp]

Congratulations for 1.5L Subscribers 🔥🌠🎉🎊. It's because of your such Quality content, this playlist will the best list for DSA.

[@Leerical-p9s]

Good lecture keep it up. It will help a lot who want to learn and apply problem solving. # graph finished 😀☺️☺️

[@ayushgoyal9871]

In gfg it is accepting for low[nbr] instead of disc[nbr] for back edge case

[@hardikjain-brb]

Got accepted for both in leetcode. God knows what is happening and why it does not matter what to use disc or low

[@asdsd-wu4yw]

best explanation throughout the web i checked almost all resources this is one of the best explanation ❤❤❤

[@Rushikesh_Khaire]

I have a quetion in which condtion the code will be returning back... I dont understand and without "return" keyword it is possible ?

[@rawat_ji5183]

perfect explanation bhiya 😁😁😁 easily samaj aa gaya hard problem

[@adityauniyal8632]

Me too😁

[@ankitkumarpathak6768]

you can use low[node]=min(low[e],low[node]); on both where updation is needed (from child or at the time of back edge found);

[@vishalsnsingh]

at the time of back edge

[@neilsancheti2473]

Thank you so much sir for this bestest content♥️ having such a strong feeling about getting placed. I am a mech student trying for a software job. Definitely bit difficult bt thia course is such a confidence 💯💯

[@peterpace3379]

Have you made any projects yet?

[@neilsancheti2473]

@@peterpace3379 yes its un the making

[@kashishjain8133]

Thanku so much for such a great series Consistency++ Josh++ Present ✋

[@KhushiKavya-py1yj]

smjh ni aya pr will come back again, 1st vdo for today

[@sharatpaul]

Your teaching technique is great , just one suggestion if you can pease use RED pen when you explain things like moving from node to node or removing an edge because if you use other color pens like WHITE or YELLOW ,sometimes it overlaps with existing lines and difficult to catch quickly with our eyes. This will be really helpful in quickly understanding what you teach.

[@naveengupta4514]

sach me bahut ganda explain kia :)

[@luckydewangan5985]

ye vala video upar se kyu ja raha hai ? abhi tak toh sab samjh me aa raha tha. Is vaale video me bhaiya ne dry run karte time hadbadi me sab kuch samjhaya hai. Although 3-4 examples run karke khud se samjh me aa gaya. 😎😎

[@abhishekanand7154]

0-3 can be bridge too, correct?

[@princhipawansaikia]

Yes

[@the-gr8-eye]

yes, i think so

[@vortexdeo4545]

8:40 ye sequence kya hai, 0->1->2->0 fir wapas 2 to 1, fir ek baar 2->0 back edge, 2->1 bridge check, 0-1> bridge check....❓ Isme dfs recursion khud hi karna padega

[@VishalGupta-xw2rp]

I'm with you bhai... This playlist is just awesome 🤩🔥

[@ayushraj6525]

I think there is a slight mistake in the low array, the low[1] should be 0 because we have to update the value during backtrack.Correct me if I m wrong.

[@luckydewangan5985]

low[1] can't be 0, because we can take low of any adjacent node except parent and 0 is parent of 1 so we can't consider it's low.

[@miss_anonymous16]

Attendence!! Bro is back with amazing videos...

[@itskaaryan7]

I did not get the backedge part when we are returning why for 1 also low will become 0 and also for 2 it is 0 ..how is it done..can anyone explain me.

[@focus.placement5589]

2 baar dekha sab clear thankss bhaiya

[@dwivedi6037]

Test me best @Babbar Bhaiya is Always best

[@artyCrafty4564]

thanxx bhaiya 😀 You made it just clear

[@shivendramaurya7585]

Little bit tough😮

[@imransjourney]

Bhai, normally talks in 1.25x speed...❤‍🔥

[@arbhavchouhan8310]

very nice bhaiya ,keep it up ,we are also making full efforts...

[@rohitmittal9061]

bhaiya aap next level smjha rahe ho har ek concept ko,, thank you very much itna acha content dene ke liye ,, bhaiya ek cheez puchni thi ki ye series khatam kab tak ho jayegi ??

[@TechUprise-by-Jyoti]

Thank you bhaiya. Consistency OP. 😊😇✨

[@muskangarg9011]

your way of explaining is very nice !! helped a lot ❤

[@B-NikhilRichhariya]

aa gaya at last smjh !

[@KACodes]

Bhaiya vapis aa gaye.....burrrah 🤟

[@PrajwalRaut]

The real consistency is here ✨ you are awesome bhaiya ✨

[@keshavarya5999]

Ye channel khatarnak hota ja raha hai DSA busted indeed

[@awesomepatt620]

Thank you for this amazing series bhaiya 🤩

[@piyushgaur6975]

bhaiya thank u smjhaaney k liye, But kuch smjh nhi aaya mjaa nhi aaya ....

[@RahulKumar-wt9qc]

Sahi bola bhai

[@dEviL_bIsWaJiT]

Thanks a lot for this awesome series bhaiya❤️🔥

[@RohitSingh-hc8yi]

loving your videos

[@dainaetishaa5006]

We always support you vaiya ..thank you always 😊😊😊

[@jaydwarkadhish959]

Sir amazing video

[@unboxtheuniverse5336]

I know if you are consistent I will Consistent automatically 😃😃❤️

[@skyquake._]

#include #include void dfs(int node, int parent, vector &discT, vector &low, unordered_map< int, bool > &visited, vector &result, unordered_map &adj, int &timer) { visited[node] = true; discT[node] = low[node] = timer++; for(auto neighbour : adj[node]) { if(neighbour == parent) { continue; } if(!visited[neighbour]) { dfs(neighbour, node, discT, low, visited, result, adj, timer); low[node] =min(low[node], low[neighbour]); if(low[neighbour] > discT[node]) { vector ans; ans.push_back(node); ans.push_back(neighbour); result.push_back(ans); } } else { low[node] = min(low[node], discT[neighbour]); } } } vector findBridges(vector &edges, int v, int e) { unordered_map adj; for(int i = 0; i visited; //Initialize for(int i = 0; i

[@vivan1852]

Present , thank you bhaiya

[@aashishrangdal9614]

Bhaiyyaa Discord pr hr sunday mentor session rakho na..!!😶😶

[@anuragraut5101]

samaj gaya

[@Reehan]

aap bhagwan ka kaam kar rhe hai keep doing it❤️

[@amitavaghosh7201]

Going to hit 100 videos can't imagine....

[@amitavaghosh7201]

Even after less views

[@nikhilverma7045]

Hats off to you 🫡🫡

[@kshitijraj1320]

Thank you bhaiya ❤❤

[@muskanchhabra4929]

thanks bhai for this expakaneatuib

[@imran_7862]

Samajh me nahi aaya... Reason: Too lengthy code, that's why it is very difficult to understand each and every steps...

[@Adarshsharma-xg1ft]

Bhai please also do some more related questions in the video

[@niteshchoudhary7705]

lysm bhaiya u are best :-)

[@hollywoodmovies1094]

keep it up..loving it🥳

[@RohitSingh-hc8yi]

thaank you bhaiya

[@paarthpatel861]

Bhaiya Shanti sa video banoo Time lagta ha to lag na do but energy ho ni chaiya Jo phele Jo banata tha👍🏻👍🏻Or aapka jasa dedicated video koi nai banata 👍🏻👍🏻🔥🔥

[@UdayKumar-gu2sg]

Bhaiyya written notes update kardo bhaiya please🙏🙏🙏🙏🙏

[@engg.5111]

🔥🔥💥💥best course

[@umangkumar2005]

ye tough ha abhi tak ka

[@chandradevkushwah932]

thank you

[@harikrushnasuhagiya3925]

thank you bhaiya

[@K_EC_SakshamSingh]

Bhaiya dynamic programming kab se shuru hogi ???

[@mysticmuskan3529]

Thanks

[@bhushannalawade4120]

Bahiya course khatam kab hone wala hai apne March ki deadline dei thi

[@Oroniislam-l6o]

Love you vaia💖💖💖

[@laxmankumawat6728]

Okay 👍

[@akankshapandey9773]

Thanku sir 🙏🏻

[@user-em7cy3cc5x]

isme parent kyu liye jab koi kaam nhi tha tooh? koi samjha do

[@yogeshsharma24]

Bhaiya time management pe video main channel pe pls request

[@fazerugbrug439]

josh is super high

[@nitinchandel4786]

Thanku bhiayya

[@beingoutofthebox8906]

Thoda sah samjha aaya I think aur ek dobar video dekhna padega

[@inspiringzone12]

Consistently+++

[@adityakeshari2295]

Understood

[@GuruPrasadShukla]

marking my attendence

[@shivamdubey3798]

Bhaiya please make a video DBMS

[@reygamingyt8007]

Ye series aur kitne dino me khtm ho jygi ..??

[@Animesh_SGIS]

In place of timer++ can we pass 'node' in function dfs ? If no ,can someone reply me why?(it will be much help)

[@acxd]

Low wale array ka significance clear nahi hua

[@usernamewhatsoever4557]

maine agar aisa course bnaya hota to m free me na deta aisi audience ko jo acknowledge bhi na kare

[@9-1939]

🔥👌

[@RajKumar-vq1nm]

❤️

[@Pikachu10-19]

Attendence++

[@PriyankPatel-k5d]

not good explaination too speedy explaination

[@vishuyadav9767]

samjh nhi aaya speed thodi thej thi explain krne ki and concept shi se nhi smjh paya

[@abhishekgamer6097]

First comment ❤️

[@deepakagrawal7687]

Sorry bro, disliking your video because didn't find your explanation or teaching of this video that good.

[@bhushannalawade4120]

Love+++++