strongly connected digraph

strongly connected digraph

[¦strȯŋ·lē kə¦nek·təd ′dī‚graf] (mathematics) A directed graph in which there is a directed path from every vertex to every other vertex.