i = isConnected P
The poset $P$ is connected if the number of connectedComponents is $1$. Equivalently, the poset $P$ is connected if between every pair of vertices in $P$ there exists a chain of relations going from one to the other.
The divisorPoset of $n$ is always connected.
|
The disjoint union of any two posets on disjoint vertex sets is disconnected.
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/Posets.m2:5644:0.