You are given an undirected connected graph. An articulation point (or cut vertex) is defined as a vertex which, when removed along with associated edges, makes the graph disconnected (or more precisely, increases the number of connected components in the graph). The task is to find all articulation points in the given graph.

Input:
The input to the function/method consists of three arguments:

numRouters, an integer representing the number of routers.
numLinks, an integer representing the number of Links.
links, the list of pair of integers - A, B representing an edge between the nodes A and B.
Output:
Return a list of integers representing the critical nodes.

Given the inputs in the following format.
public List(Integer) getCriticalNodes(int numRouters,int numLinks, ArrayList<ArrayList<(Integer)>links)

I am using () for <> as it was not allowing me in the post

Hello I am new to java and can any one help me with the solution for this problem when the input is given in ArrayList<ArrayList<(Integer)> links format

Thank you!