mcs {ess} | 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)
[Package ess version 1.1.2 Index]