Articulation Point | Cut Vertex

In case you are thinking to buy courses, please check below:

---------------------------------------------------------------------------------------------------------------------------------------------------- Pr-Requisites: DFS and Bridges video of the Graph Series
Watch at 1.25x for best experience.

Follow them on social media for all updates:

---------------------------------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------------------------------

#dsa​ #striversgraphchallenge​ #placements

[acousticIndie]

After completing it, PHEWWWW, it used to seem so hard Striver. You explained it so smooth, Thank you. Hope to be somewhere prominent sooner or later. Never stop trying! Thank

[fenilsoni]

Just a thought: The Nodes involved in the bridge of a graph are the articulation points of the graph? Eg: The line Between Node 4 to Node 5 is a Bridge so Node 4 and Node 5 are Articulation points. Similarly, the line Between Node 5 to Node 6 is a Bridge so Node 5 and Node 6 are Articulation points. Similarly, the line Between Node 8 to Node 10 is a Bridge so Node 8 and Node 10 are Articulation points. If we get distinct of all these nodes like we take set data structure we will get the final answer as 4, 5, 6, 8, 10 as articulation points? Correct me if i am wrong

[irfanaliansari]

Just 2 videos away from completing the entire series.
Thanks for providing such contents for free of cost❤️

[zeenatfirdoshquadri]

samajhne me thoda time laga qki child wala part dry run me nhi bataya tha but still I understood it after few efforts. At last Thankyou so much, it helped alot...

[gowthamreddyuppunuri]

If not 100 percent understood as of now, get bridges and collect nodes of those bridges and there you go, you got articulation points but for each node that forms a bridge, then make sure degree of that node > 1

[AsliArtistVlogs]

lowest time nomenclature seems very off, pls try to call it low link value, as it basically tells you the lowest backward edge connection link for the child of the nodes. Nonetheless, thanks for a wonderful explanation.

[araragikoyomi]

Bahut maja aa raha hai aise concepts itne easy way me samajhne me, thanks bhaiya🙏

[nitinkumar]

I have Completed this series in a week

[saptarshidechaudhury]

A small correction: low[node] should be updated by min(low[node], low[it]), not tin[it].
Line 22, time: 20:50

[theuntoldtree]

there is mistake in java code, parent==-1 should be there for checking of first not articulation

[aasthajha]

I don't want this series to end...lol😂😂😂..
thank you bhaiya.

[rishabhkumar]

its such a concise and great great explanation, I have ever saw, thank you sir for doing hard work for us

[niharika]

In line number 22, why can't we take low[node] as min(low[node], low[it]) ?

[ashwanisharma]

TIP: (copied) : So ultimately it all converges down to finding a back edge for every vertex. So, for that apply a DFS and record the discovery time of every vertex and maintain for every vertex the earliest discovered vertex that can be reached from any of the vertices in the subtree rooted at . If a vertex is having a child such that the earliest discovered vertex that can be reached from the vertices in the subtree rooted at has a discovery time greater than or equal to, then does not have a back edge, and thus will be an articulation point.

[kumarsatyamadarsh]

I'm submitting the same code after watching this video in gfg-question( articulation point-1) but, it is showing wrong answer on test case 159-as i think in this case, it is taking parallel edges, what to do now

[_shivanshrahangdale]

for those who are thinking to solve this like previous video(yes, almost same approach is used here) . watch this video as well because important test cases are discussed here .

[SumitSharma-douc]

there is an correction in java code ( parent==-1) : line : 25

[rajarishabh]

when neighbouring node is visited why are we updating and comparing from disc time rather than low time of it

[satyendrayadav]

For those who are thinking endpoints of a bridge are articulation points, Answer to that is No.
Example:


Vertex 1 and 2 are connected and (1, 2) is a bridge. But none of them is an articulation point.

[naveensolanki]

There is slight error in the code.
A child++ statement must be added before calling dfs at line 13.
Time stamp 23:55