partition: The Coarsest Partition of a Finite Sequence of Sets for Which...

Description Usage Arguments Value Author(s) See Also Examples

Description

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

Usage

1

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

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

BGSIMD documentation built on May 29, 2017, 6:10 p.m.