critical-routers.md

title	description	authors	tags	categories	date	lastmod	draft	archive
Critical Routers	Some description ...	lek-tin	leetcode dfs connected-components	algorithm	2020-03-02 00:18:54 -0800	2020-03-02 00:18:54 -0800	false	false

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:

• numNodes, an integer representing the number of nodes in the graph.
• numEdges, an integer representing the number of edges in the graph.
• edges, 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.

Example

Input: `numNodes` = 7, `numEdges` = 7, edges = [[0, 1], [0, 2], [1, 3], [2, 3], [2, 5], [5, 6], [3, 4]]


Output: [2, 3, 5]