strongly connected
Of a directed graph, such that for every pair of vertices u and v there is a path from…Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u.
Meaning
2 senses(not comparable)Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u.
(not comparable)Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u.