In Tarjan’s Algorithm for finding Strongly Connected Components, when encountering a back edge, why do we use the discovery time of the ancestor node instead of its lowest reachable time? Many blogs and tutorials stress on this point, but I couldn’t find examples where low[] and disc[] differ for ancestor nodes in the back edges.