Depth First Search can be used to find cut vertices.
The average case time complexity is
O(V+E)and the auxiliary space complexity is
Refer the article for more details and implementations.
Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at http://iq.opengenus.org/find-articulation-points-or-cut-vertices-in-a-graph/