Weakly Connected Component
A weakly connected component is a maximal subgraph of a directed graph such that for every pair of vertices
, 
in the subgraph,
there is an undirected path from 
to 
and a directed
path from 
to 
. Weakly connected
components can be found using WeaklyConnectedComponents[g]
in the Wolfram Language package Combinatorica`
(Skiena 1990, p. 172).
Contact the MathWorld Team
Apollonian network