Therefore, the `weighted_deg` binary can be removed as the `deg` binary
already includes the multiplicities of the edges.

Be more incremental in the construction of random connected components to significantly reduce runtime.

Provide separate applications to sample from both weakly and strongly maximal fully connected subsets.

As the reachability relation implied by the accessibility graph is not transitive, sample maximal fully connected subsets instead of using existing algorithms for the construction of connected components.