A directed graph is strongly connected if every node can be reached from every other node.

If this is not true, the graph is not strongly connected.

Below, you can see an example of both.

Even though not all directed graphs are strongly connected, we can partition the nodes into strongly connected components.