mcs: Maximum Cardinality Search
In ess: Efficient Stepwise Selection in Decomposable Models
mcs R Documentation
Maximum Cardinality Search
Description
Maximum Cardinality Search
Usage
mcs(adj, check = TRUE)
Arguments
adj
A named adjacency list of a decomposable graph
check
Boolean: check if adj is decomposable
Details
If adj is not the adjacency list of a decomposable graph an error is raised
Value
A list with a perfect numbering of the nodes and a perfect sequence of sets
Examples
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 Jan. 10, 2026, 5:06 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| mcs | R Documentation |
Maximum Cardinality Search
Description
Maximum Cardinality Search
Usage
mcs(adj, check = TRUE)
Arguments
adj |
A named adjacency list of a decomposable graph |
check |
Boolean: check if adj is decomposable |
Details
If adj is not the adjacency list of a decomposable graph an error is raised
Value
A list with a perfect numbering of the nodes and a perfect sequence of sets
Examples
x <- list(a = c("b", "d"), b = c("a", "c", "d"), c = c("b", "d"), d = c("a", "c", "b"))
mcs(x)
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.