From an Undirected Graph to Kosaraju: The Thought Process Behind Codeforces Problem 1986F (1900…

How “remove one edge to minimize reachable pairs” turned into running an SCC algorithm on a graph that starts out undirected — and a full…