Checks that the input graph is a valid graph for an extremal graphical model. If necessary, converts the graph to an undirected graph. Removes vertex labels if present.
check_graph(
graph,
graph_type = c("general", "decomposable", "block", "tree"),
check_connected = TRUE,
nVertices = NULL
)The given graph, if necessary converted to undirected.
If the graph is not valid an error is thrown.
An [igraph::graph] object.
"general", "decomposable", "block", "tree". The required type of graph.
Whether to check if the graph is connected.
The number of vertices required in the graph.
Other input validation functions:
checkGamma(),
check_partial_matrix_and_graph(),
ensure_matrix_symmetry()