Articulation Point and Bridges || Graph theory

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. For a better experience and more exercises, VISIT: www.pepcoding....
Have a look at our result: www.pepcoding....
Follow us on our UA-cam page: / pepcoding
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Follow us on Pinterest: / _created
Follow us on Twitter: home
.
.
.
Happy Programming !!! Pep it up 😍🤩
.
.
.
#pepcoding #code #coder #codinglife #programming #coding #java #freeresources #datastrucutres #pepcode #competitive #competitiveprogramming #softwareengineer #engineering #engineer

[@shang_chi4651]

I searched more than 10 videos to find out the logic behind why can't we use low value of a visited neighbor to update my low value. But subhesh sir explained it so clearly. Jitna thanks kahoon kam hai sir aapko🙏

[@Pepcoding]

I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
ua-cam.com/users/Pepcodingabout?view_as=subscriber

[@skiver9763]

had been struggling to hold of this concept and had previously tried multiple videos on youtube but this was the one that hit the spot and made me understand the topic.
A big thanks to pepcoding and subhesh sir.

[@Pepcoding]

Glad it was helpful!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.

[@ayankhokhar]

Sir, pepcoding ka content kaafi rich hai thank you so much for providing such amazing content for free.

[@Pepcoding]

So nice of you and If you like the content could you post something on LinkedIn about us? This will help us in reaching out to more people and help a lot of other students as well
Something like this
Sumeet Malik from Pepcoding is making all his content freely available to the community
You can check it out here - www.pepcoding.com/resources
/
Also, this is the youtube channel - ua-cam.com/users/Pepcodingplaylists?view_as=subscriber

[@ayankhokhar]

@@Pepcoding Sure

[@DivyaPrakash-bj6zk]

Sir You are the most underrated teacher in the whole community. ❤️❤️❤️

[@mr.dependable4885]

Tried almost all alternatives but only you explained the algo so thoroughly and all the why's , kudos sir

[@bhaskarmishra8479]

It would be ungrateful of me if I didn't thank you and Pepcoding for putting up this graph series on UA-cam. I can't thank you enough!

[@stith_pragya]

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

[@master_persi]

why we are not checking count for every node .
How it is working only for src node .

[@bikideka7880]

personal time stamp 50:00

[@manasbohat6883]

nobody can explain like the pepcoding team, amazing

[@noobCoder26]

Superb content I struggled with this topic a lot before reaching to this video

[@YashSingh-ir3ec]

Petition to make THE PEPCODING channel a national treasure!

[@Pepcoding]

This really means a lot, for better experience and well curated content sign up on nados.io and start learning.

[@ChahatGoyal-rd1bl]

thanks a lot sir😄

[@vasubansal5834]

Great video, I had just one doubt and it was covered in this video!

[@Pepcoding]

Glad it was helpful! For better experience and well curated content sign up on nados.io and keep learning.

[@ritikjalal117]

snake and ladder wali problem cover karna sir

[@algoprep_official1234]

Sure

[@ok_7566]

please draw back edges in dots it might be confused by tree structure.

[@meme_engineering4521]

sir ye please playlist mein daal do, btw thanks for this video

[@hhumar987]

too good explanation bro!! thanks a lot

[@kartiksood5508]

Do we really need a visited array? can't we check if it is visited by checking the discovery array?

[@ROSHANKUMAR-rl6bf]

very well explained as usual u alwyas focus on concept rather than making a dry run vdo Number theory pe agar 1 playlist bna do aap to tahalka ho jaye

[@sharanpreetchadha5281]

Really amazing video , got the concepts crystal clear

[@Pepcoding]

Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.

[@samkitjain2136]

sir why cant we take low[v]>=low[u]{
ap[u]=true}
instead of disc[u] in last condition?

[@sharanpreetchadha5281]

try the case for this graph with nodes 0,1 and 2 and edges 0->1,0->2,1->2 , you will get the answer. when low[v]>=disc[u] , it means that the neighbor of the node can reach a node which was discovered earlier than the node(through an alternate route) meaning , that even if we remove the node, then also the components will remain connected . However , if you try the condition you mentioned for the graph above , you will find that 1 or 2(depending on the way you traverse starting from 0) will come out to be a articulation point which is not the case therefore it is not a valid condition

[@sujan_kumar_mitra]

Nice Explanation.

[@divyamgoel9183]

Best !!

[@akatsuki1363]

Best🔥🐐

[@Pepcoding]

Glad you love the explanation.
For better experience and well organised content sign up on nados.io and don't forget to follow us on Instagram instagram.com/pepcoding/

[@ayushmangore7045]

Fabulous

[@cse8381]

Thank you!

[@Pepcoding]

You're welcome!
visit naods.pepcoding.com

[@anishsuman1371]

Fabulous ❤️

[@Pepcoding]

Glad you liked it!
Keep learning.
And for better experience and well organised content visit nados.pepcoding.com

[@dhawalpatil7779]

Best

[@Pepcoding]

Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.

[@LegitGamer2345]

someone : graphs are not that difficult
tarjans algorithm / articulation point : say sike right now

[@sujan_kumar_mitra]

Waiting for Bridge Video

[@bikideka7880]

best

[@Pepcoding]

Glad you love the explanation, for better experience and well curated content sign up on nados.io and start learning.

[@adnanniazi9954]

Please sir

[@loserfruit9663]

Op

[@mayur_madhwani03]

OMG

[@Pepcoding]

If you also want doubt support, you can consume same content on nados.pepcoding.com and a social media feed where your doubts will be taken care of.
It is entirely free of charge.

[@matchpredictionwithacid9419]

yaar sound quality kitna ghatiya h