Weakly connected graph
Материал из WEGA
Weakly connected graph --- слабо связный граф, слабый орграф.
A digraph not representable as [math]\displaystyle{ G_{1} \cup G_{2} }[/math], where [math]\displaystyle{ G_{1}, G_{2} }[/math] are vertex-disjoint non-empty digraphs.
