partition {BGSIMD}R Documentation

The Coarsest Partition of a Finite Sequence of Sets for Which Only Consecutive Sets May Overlap

Description

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

Usage

partition(ms)

Arguments

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.

Value

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

Author(s)

Kwang Woo Ahn and Kung-Sik Chan

See Also

part and block.gibbs

Examples

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

[Package BGSIMD version 1.0 Index]