Critical Connections in a Network
There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between servers ai and bi. Any server can reach other servers directly or indirectly through the network. A critical connection is a connection that, if removed, will make some servers unable to reach some other server. Return all critical connections in the network in any order.
Critical Connections in a Network

There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between servers ai and bi. Any server can reach other servers directly or indirectly through the network. A critical connection is a connection that, if removed, will make some servers unable to reach some other server. Return all critical connections in the network in any order.

Example 1:
Input: {"n":4,"connections":[[0,1],[1,2],[2,0],[1,3]]}
Output: [[1,3]]
Input
arr ={"n":4,"connections":[[0,1],[1,2],[2,0],[1,3]]}

Built graph with 4 nodes. Starting Tarjan's algorithm.

0

1

2

3

Tarjan's Values
disc[]
-
-
-
-
low[]
-
-
-
-
Critical Connections (Bridges)

None found yet

Current
Parent
Visited
Bridge
Variables
No variables to display
DepthFunction Call
Stack empty
0/6