Is there a fast implementation of finding articulation points if the graph is given as a set of edges i.e [[1, 2], [2, 3]] ...

I see the solutions are based on adjacency list representation. Do I have to convert the edge list into adj list?