Articulation Point (Cut-Vertex) in Graph

[Naman-18]

Hey! @tarun26091999 @rudrakshi99 @shreyanspoddar @nakul-19 @plazzy99 I am GSSOC'21 Participant and I would like to implement following Graph Algorithm in C++:

Algorithm to Find Articulation Point(Cut Vertex): An Articulation Point is defined as a vertex whose removal of self and related edge makes a graph disconnected. In a Graph if an edge (node1,node2) is a bridge then either node1 or node2 is an articulation point. In a condition if there are no bridge , Even then if a cycle exist it is also an indication of probable existence of an Articulation point.

I can contribute clean and well-commented code so that it gives readability to all users. Please assign me this issue.

[rk05-lenavo]

I'm the participant in GSSOC'21. Could you please assign me this.I would love working on this.

[tarun26091999]

@rk05-lenavo specify the language.

[shubhidua]

I would like to contribute to the above problem in java as I am a participant of GSSOC'21. Kindly assign this to me. @tarun26091999