Algorithm to find Articulations points

[ZigRazor]

Please add an algorithm to find articulation points of a graph

[RachitGarg-12]

hey @ZigRazor please assign me this issue

[ZigRazor]

Yes! @RachitGarg-12

[ZigRazor]

@RachitGarg-12 are you working on it?

[pradkrish]

is this still available? I am happy to work on this.

[ZigRazor]

Yes, is still available, I assign it to you @pradkrish !

[pradkrish]

Thanks. There seem to be two different approaches. A simple approach where vertices are removed one by one and see if removal of a vertex causes disconnected graph and another approach being Tarjan's algorithm. Which one do you prefer?

It's also possible to have both approaches, one can be called articulation_points_simple() and another one called Tarjan().

[ZigRazor]

Taranto algorithm should be already implemented

[pradkrish]

Yes, Tarjan's can be used to find both Strongly connected components and articulation points. In that case, do you think it's best to first work on Tarjan's and then use that implementation for finding articulation points?

[ZigRazor]

Yes, but I think for completness the best way is implement both algorithms

[pradkrish]

Not sure what you mean by both here? :) Helpful if you can spell it out.

By both, did you mean both implementations for finding articulation points, that is, one using a simple method and another using Tarjans?

Or by both, did you mean using Tarjan's algorithm for finding Articulation Points and Strongly connected components?

[ZigRazor]

Both for me means implementation with simple method and implementation with tarjan algorithm

[ZigRazor]

@pradkrish any news?

[ZigRazor]

De-assigned due to inactivity