partition: The Coarsest Partition of a Finite Sequence of Sets for Which...
In BGSIMD: Block Gibbs Sampler with Incomplete Multinomial Distribution

The function computes the coarsest partition of a finite sequence of sets for which only consecutive sets may overlap.

1	partition(ms)

`ms`	the sequence of finite sets whose coarsest partition is required. These sets must be entered in the order under which only consecutive sets may have non-empty intersection.

A list comprising the sets that make up the coarsest partition.

Kwang Woo Ahn and Kung-Sik Chan

1 2	ms<-list(c(3,4),c(5,6,7),c(6,7,8,9)) partition(ms)

BGSIMD documentation built on May 2, 2019, 5:12 a.m.

BGSIMD index

Package overview

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description