## strongly-connected

Adjective

(*not comparable*)

- (graph theory) 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*. - (graph theory) 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*.