Directed graph - Wikipedia, the free encyclopedia
A directed graph is weakly connected (or just connected [4]) if the undirected underlying graph obtained by replacing all directed edges of the graph with undirected edges is a connected graph. A directed graph is strongly connected or strong if it contai...