is_decomposable: A test for decomposability in undirected graphs
In mlindsk/ess: Efficient Stepwise Selection in Decomposable Models

Description Usage Arguments Value Examples

This function returns TRUE if the graph is decomposable and FALSE otherwise

1	is_decomposable(adj)

adj

Adjacency list of an undirected graph

Logial describing whether or not adj is decomposable

# 4-cycle:
adj <- list(a = c("b", "d"), b = c("a", "c"), c = c("b", "d"), d = c("a", "c"))
is_decomposable(adj) # FALSE
# Two triangles:
adj2 <- list(a = c("b", "d"), b = c("a", "c", "d"), c = c("b", "d"), d = c("a", "c", "b"))
is_decomposable(adj2) # TRUE