Article: Finding Bridges in O(N+M)

Problem:

In the algorithm section in this, The problem is on the below line
So, let  tin[v]  denote entry time for node  v. We introduce an array  low which will let us store the node with earliest entry time found in the DFS search that a node  v can reach with a single edge from itself or its descendants.

In the low array, we are not actually storing the node itself, but the earliest entry time of some node, we are able to reach

I believe it should be We introduce an array low which will let us store the earliest entry time of the node found in the DFS search that a node  v can reach with a single edge from itself or its descendants.