A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair
of distinct vertices 
, 
in the subdigraph, there is an undirected path from 
to 
. Weakly connected components can be found in the Wolfram
Language using WeaklyConnectedGraphComponents[g].
Weakly Connected Component
See also
Connected Component, Directed Graph, Strongly Connected Component, Weakly Connected DigraphExplore with Wolfram|Alpha
References
Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, 1990.Referenced on Wolfram|Alpha
Weakly Connected ComponentCite this as:
Weisstein, Eric W. "Weakly Connected Component." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/WeaklyConnectedComponent.html