PART- 3: BI-CONNECTED COMPONENTS: IDENTIFYING THE ARTICULATION POINTS IN A GIVEN GRAPH

[@afrahshabbeer4181]

I was struggling since two days to understand Articulation point algorithm,I gone through many videos on this topic,but wasn't able to understand a single step...But after listening to this lecture I understood each and every idea behind using Dfn value and Low value... Thanks alot Sir👏👏👏 Your explanation was just amazing.

[@rekharaju9716]

Tq alot sir.u r way of explanation is simple super

[@vivekanandan1762]

Sir it is really awesome explanation than my professor, thankyou very much sir

[@gummallasailakshmi5804]

Your explanation is super sirrrr👌👌

[@DIVVELASRINIVASARAO]

Thank u for your support Sai Lakshmi Garu. Please subscribe my KZbin channel kzbin.info please forward the videos to your friends and classmates

[@karthikamanokaran3142]

well explained sir👏👏👏 thanku

[@DIVVELASRINIVASARAO]

Thank for your support Kathika. Please subscribe my KZbin channel kzbin.info and also forward the videos to your friends and classmates

[@NBANDREDDIHARINANDINI]

There is an edge from vertex 5 to 8 in given graph.But you don't draw any back edge from 8 to 5 in dfs spanning tree,right?

[@juhiesayyed]

thank you sir

[@Duffer_the_Hari]

Thank you much sir