 Free random-cluster boundary condition

The boundary partition has singleton blocks, so no different boundary vertices are identified. Open component counting is the ordinary counting in the finite graph, including isolated vertices. This is the least wired random-cluster boundary condition.