A `` strongly connected graph '' is a directed graph in which every ordered pair of vertices in the graph is strongly connected .
A `` strongly ordered graph '' is a directed graph in which every connected pair of vertices in the graph is strongly connected .