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].
| CARVIEW |
Select Language
HTTP/1.1 200 OK
Date: Mon, 29 Dec 2025 20:22:29 GMT
Server: Apache
Set-Cookie: WR_SID=134.209.151.76.1767039749457369; path=/; expires=Thu, 27-Dec-35 20:22:29 GMT; domain=.wolfram.com
Accept-Ranges: bytes
Transfer-Encoding: chunked
Content-Type: text/html
Weakly Connected Component -- from Wolfram MathWorld
TOPICS
TOPICS
Weakly Connected Component
See also
Connected Component, Directed Graph, Strongly Connected Component, Weakly Connected DigraphExplore with Wolfram|Alpha
More things to try:
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 Resource. https://mathworld.wolfram.com/WeaklyConnectedComponent.html