Lecture 99: Articulation Points in Graphs || C++ Placement Series

[@akarshitgupta6359]

thanks for reminding me," Why I started" thanks brother.

[@KACodes]

Arey bhaiya.....swad aa gaya.... content++ ...... Consistency ++

[@tejasshaha6629]

OP explanation bhaiya. Ekdam mast relate hua Bridges in graph se. Thanks a lot.

[@prashantbirajdar9271]

haa bhaiya samaj aya subkuch badhiya tarike se thank you bhaiyaa..love you

[@TechUprise-by-Jyoti]

Thank you bhaiya. Consistency OP 😇✨

[@ritikraj26_]

Pausing the video to appreciate the effort made in the explanation. Thanks a lot.

[@smartcoding174]

present sir.... consistency ++......god bless you brother 👍

[@sumitdebnath7543]

u are the best alwayas best babbar bhaiya best...plz continue rakhna bhaiya

[@focus.placement5589]

last video samajh mei aaya isliye ye samajh aaya thanksss bhaiaya God bless u ❣♥💚💜🫀

[@stith_pragya]

Thank You So Much for this wonderful video........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@studygainer5482]

consistency ++......god bless you brother 👍

[@pramantomar822]

Bhaiya negative comments ko plz ignore karna u r the best and we are always with you Most importantly take care of your health ❣️❣️❣️❣️❣️

[@skchoudhary7956]

Back to consistency💯

[@laxmankumawat6728]

Last me jo nhi samj aaya woh bi aa gya 💘

[@sukhjitsingh959]

In this vedio better understanding of concepts only having doubts in child = 0 , child++ so speaking speed is good in this vedio so thanks ...sir

[@kunalmodiart]

you are recursively calling dfs on eachnode for each node he made a child variable and incremented when traversing over the neighbours in the end checked if that node's parent is -1 means that node is a root node and has child more than 1 means removing such node will create disconnected components add that node (root node)in the ans

[@sourabh2659]

​@@kunalmodiart How he is returning to the parent node if that node is already visited?

[@Singh_Sahdev]

That's what recursion and backtracking is, we don't want to visit them, they come after there child call of dfs are over

[@rachit_joshi]

Thank You So Much BHRATA SHREE !!!!!!!

[@vivan1852]

Consistency++, Present bhaiya

[@kunalsharma1740]

Finally finished the graph series thank you bhaiya!!

[@JorawarSingh-n4s]

thanks babbar sir

[@vishalvaishnav8846]

Bhiya Continue RaKhan Sub Viewers a Rahe hai Video dekhte dekhte

[@priyabratroutray8184]

I think we don't need visit array ,if a node is discovered that means it is visited so for an visited node disc[node] != -1

[@sciencestreamers8509]

Bhaiya, will meet u after busting Microsoft ❤️

[@shahbaz_shaikh_vip100]

Kis company me ho ab

[@yashtyagi2107]

Thanks bhaiaa for giving us hope🙏

[@VishalGupta-xw2rp]

Swad aa gaya 🔥

[@nishankdeep3084]

thank you bhaiya

[@iteself_me]

65 ✅completed 👍Liked 10:20

[@fazerugbrug439]

superb

[@utsavkumar9734]

Thanks for the video.

[@GuruPrasadShukla]

samajh aagya++

[@dEviL_bIsWaJiT]

Thanks a lot bhaiya❤️🔥 *#believeinbabbarbhaiya*

[@adarshshrivastava410]

i have a doubt, suppose the parent of the node is -1 and it does have more than one child.. but still if those child have a connection between them that would mean that our node is not an AP.

[@vanshrana7807]

consider a graph with 5 nodes {1,2,3,4,5} with edges {(1,2),(2,3),(3,4),(4,1),(5,3),(5,4)} consider nodes 1,2,3,4 as corners of square and 5 as center (better visualization) now consider 5 as source node then parent of 5 will always remains -1, dfs works as 5 -> 4 -> 1 -> 2 -> 3 -> 5 (upto here the child of 5 is only one node (with value=4) now at this point 5 is already visited so you return from 5 -> 3 -> 1 -> 4 -> 5 . tries to move to the 2nd child of 5 which is 3 but already visited and child of node 2 (in dfs computation already) and can't be add to the child of 5 thus the child of source node 5 remains 1(only 4) - as you mentioned "still if those child have a connection between them" yes they have connections in the above graph but the child of 5 remains one. hence 5 (source node) cannot be act as AP. I hope this will explanation will help you. Thanks !!

[@pragyaverma2105]

Thank u ji ❤

[@sachinbhandare399]

Bhayyaji 1 June wala surprise kitne baje ayega ?

[@Pikachu10-19]

Consistency++

[@KratosProton]

great

[@akankshapandey9773]

Thanku sir🙏🏻

[@chandradevkushwah932]

thank you

[@KhushiKavya-py1yj]

9 to go

[@KhushiKavya-py1yj]

1st done

[@vishalgarna4580]

❤❤❤❤😊😊😊

[@raezungton]

Where can we solve this question?

[@yashzawar7938]

🔥

[@9-1939]

🔥👌

[@aashishrangdal9614]

Consistency++;

[@engg.5111]

💥💥💥

[@AbhishekSharma-tm2ko]

Attendance++

[@UdayKumar-gu2sg]

Bhaiyya please written notes update kardo bhaiya 🙏🙏🙏🙏

[@whatsnext7778]

nice sir

[@harikrushnasuhagiya3925]

💗💗

[@bkjaipal1126]

Bhaiya plz grid wale question krawo mainly whi aate h paper me.

[@ShivamPandey-xh7cd]

Sir what if we have a parent with more than one child, such that each child is connected to one and another, then the Source Node (Zero) Is NOT Actually an Articulation Point then It is considered So as per your algorithm. ??

[@arpitraj5826]

because this case will be handled by the back edge condition

[@RajKumar-vq1nm]

❤️

[@nitinchandel4786]

Op

[@avronilbanerjee5302]

bridges k condition me > but articulation point ke condition me >= aisa kyu kiya sir

[@devanshbatra308]

bro did you get the answer?

[@iamnoob7593]

which means u did not understand bridges core concept.

[@hardikjain-brb]

@@iamnoob7593 Aap hi samjha do sir = kyu liya aur !visi[i] mai disc[it] le ya low[it] agar itna hi samajh aa gaya hai aapko>!

[@iamnoob7593]

@@hardikjain-brb >= because ur reaching the parent node and > for edge(means u r reaching a node before parent).

[@amaan1180]

​@@iamnoob7593 bhai can you explain more deeply i am unable to understand this😢😢

[@yashnarang3014]

what the point of running in replet instead of vs code

[@yashtyagi2107]

Attendence marked

[@harikrushnasuhagiya3925]

💯❣❣💯

[@miss_anonymous16]

Attendence marked!!!!

[@tbmsahil8850]

First view

[@jai598]

where are the parents updated, why there is not any parent array?

[@Singh_Sahdev]

Because in recursion we call every node individually hence the parents are send with call only, so no need of extra data structure for parents, You can make that but this will increase overhead only

[@nikhileshratna]

bhaiya zero waale node ko alag se handle krne ki jarurat kyon hai?

[@Singh_Sahdev]

0 nahi agar dfs kahi se bhi start kroge, usko alag se handle krna padega

[@vmstudy9965]

Bhaiya ye smj to aya but bridge or articulation dono. Complicated lga thoda😢

[@Xd-dw7oe]

can anyone send the link of this question

[@tarangtyagi4371]

parent == -1 ke case ko alag se kyon handle kar rahe hn?

[@sahilnagpal9150]

brother ek baar 0->1->2 k liye dry run krke dekho without -1 k sath to 0 bhi articulation point aayaga but actually m vo nhi h

[@StudentjatinJatin]

kon kon hai jo 2024 ma kar ra

[@satyasuvartha8595]

Use Hindi for thumbnails also 😢

[@Profnegi]

bhyi kya chl raha hai. mera dimag itna chota hai kya? :(

[@vortexdeo4545]

Thoda toh mushkil topic

[@shalinisaini3787]

Thank You So Much for this wonderful video........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@animeshpandey2911]

op

[@shadab_196]

bridges k condition me > but articulation point ke condition me >= aisa kyu kiya sir

[@Singh_Sahdev]

Bhai abhi abhi samajh aya

[@Singh_Sahdev]

Deakho agar bridge check krna hai and 0->1 ke beech me 2 edges hui to koi bhi ek edge bridge nhi hogi But articulation point ke case me chahe 0->1 ke beech kitni bhi edges ho 0 articulation point hi hoga To mere kehene ka mtlb hai ki bridge ke liye ek back edge agar parent tk bhi hogi to bridge nhi hoga hence used > sign And articulation point me ek backedge uske parent ke parent tk honi chahiye tabhi articulation point nhi hoga hence used >= sign

[@nijalpatel5281]

op