Strong connectivity 2026-09-24
A directed graph is strongly connected when every vertex is reachable from every other vertex by a directed path.