One doc tagged with "tarjan"

In a directed graph, two vertices are strongly connected if each can reach the other — a path