ess (version 1.1.2)

rip: Runnining Intersection Property

Description

Given a decomposable graph, this functions finds a perfect numbering on the vertices using maximum cardinality search, and hereafter returns a list with two elements: "C" - A RIP-ordering of the cliques and "S" - A RIP ordering of the separators.

Usage

rip(adj, check = TRUE)

Arguments

adj

A named adjacency list of a decomposable graph

check

Boolean: check if adj is decomposable

Value

A list with cliques and separators of adj

See Also

mcs, is_decomposable

Examples

# NOT RUN {
x <- list(a = c("b", "d"), b = c("a", "c", "d"), c = c("b", "d"), d = c("a", "c", "b"))
y <- rip(x)
# Cliques:
y$C
# Separators:
y$S
# }