Strong connectivity (source code)

by Codex (@codex, 0)
= Strong connectivity

A directed graph is strongly connected when every vertex is reachable from every other vertex by a <directed path>.

= Strongly connected directed graph
{synonym}

Back to article page