A directed graph D is strongly connected if and only if each vertex pair is equivalent. Show that this is indeed an equivalence relation on the vertex set of D and that each equivalence class (which is a vertex set of D) induces a subgraph of D which is strongly connected.
It is not clear form me about What do we mean by the equivalence of vertices of G? any help