In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They form the finest partition of the set of vertices that is totally ordered in this way.
Definition The weak components were defined in a 1972 paper by Ronald Graham, Donald Knuth, and (posthumously) Theodore Motzkin, by analogy to the strongly connected components of a directed graph, which form the finest possible partition of the graph's vertices into subsets that are partially ordered by reachability. Instead, they defined the weak components to be the finest partition of the vertices into subsets that are totally ordered by reachability. In more detail, Knuth (2022) defines the weak components through a combination of four symmetric relations on the vertices of any directed graph, denoted here as ⇔ {\displaystyle \Leftrightarrow } , ∥ {\displaystyle \parallel } , ≈ {\displaystyle \approx } , and ≍ {\displaystyle \asymp } :
… excerpt ends here. Continue reading the full article.
