Topic summary
Directed edge
Extracted from the Wikipedia article Directed graph.
Directed graph connectivity
A directed graph is weakly connected (or just connected) if the undirected underlying graph obtained by replacing all directed edges of the graph with undirected edges is a connected graph.