 Wired random-cluster boundary condition

All boundary vertices are identified into one vertex for component counting. This is the most wired random-cluster boundary condition on a fixed boundary, and maximizes increasing-event probabilities when $q\ge 1$ by boundary monotonicity of the random-cluster measure.