mcs: Maximum Cardinality Search
In ess: Efficient Stepwise Selection in Decomposable Models

Maximum Cardinality Search

1	mcs(adj, check = TRUE)

`adj`	A named adjacency list of a decomposable graph
`check`	Boolean: check if adj is decomposable

If adj is not the adjacency list of a decomposable graph an error is raised

A list with a perfect numbering of the nodes and a perfect sequence of sets

1 2	x <- list(a = c("b", "d"), b = c("a", "c", "d"), c = c("b", "d"), d = c("a", "c", "b")) mcs(x)

ess documentation built on May 31, 2021, 9:10 a.m.

ess index

Package overview README.md

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

Description