i have read this article but didn’t able to understand the line : “low[u] = min(low[u], disc[v]);
In case two, can we take low[v] instead of disc[v] ?? . Answer is NO. If you can think why answer is NO, you probably understood the Low and Disc concept.”
as far i have understood low[v] is the lowest node value which we can reach from current node. so, if we have found an edge(back edge not cross one) to an upper level node(already visited node) from current node then it means we can reach to this node from current one and if it has (low != disc) then we should consider it’s low value as we are able to reach here (and so able to reach anywhere where this node can reach)!
please correct me if i am wrong.
and if someone has better tutorials please share