
Rameshwari
@datacode2025
ID: 1784228289529380864
27-04-2024 14:29:30
172 Tweet
14 Followers
57 Following

Day 146✅Of 160gfg Challenge Problem-Articulation Point Approach-Convert edge list to adjacency list Run DFS to track discovery time & low values If root has >1 children, it's an AP If low[v] >= disc[u] & u isn’t root,it's an AP #160gfgchallenge GeeksforGeeks #womenintech
![Rameshwari (@datacode2025) on Twitter photo Day 146✅Of 160gfg Challenge
Problem-Articulation Point
Approach-Convert edge list to adjacency list
Run DFS to track discovery time & low values
If root has >1 children, it's an AP
If low[v] >= disc[u] & u isn’t root,it's an AP
#160gfgchallenge <a href="/geeksforgeeks/">GeeksforGeeks</a> #womenintech Day 146✅Of 160gfg Challenge
Problem-Articulation Point
Approach-Convert edge list to adjacency list
Run DFS to track discovery time & low values
If root has >1 children, it's an AP
If low[v] >= disc[u] & u isn’t root,it's an AP
#160gfgchallenge <a href="/geeksforgeeks/">GeeksforGeeks</a> #womenintech](https://pbs.twimg.com/media/GpUYGXsWMAAx4Su.jpg)