weakly connected digraph

weakly connected digraph

[¦wēk·lē kə‚nek·təd ′dī‚graf]
(mathematics)
A directed graph whose underlying graph is a connected graph.