What is the meaning of Strongly_connected?

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.

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.

Source: wiktionary.org