Unified approach to query a graph about its properties (based partly on functionality from gRbase and functionality imported from RBGL).

querygraph(object, op, set = NULL, set2 = NULL, set3 = NULL)

qgraph(object, op, set = NULL, set2 = NULL, set3 = NULL)

ancestors(set, object)

subGraph(set, object)

is.triangulated(object)

connComp(object)

ancestralSet(set, object)

ancestralGraph(set, object)

parents(set, object)

children(set, object)

separates(set, set2, set3, object)

closure(set, object)

adj(object, set)

is.simplicial(set, object)

simplicialNodes(object)

is.complete(object, set = NULL)

is.decomposition(set, set2, set3, object)

nodes_(object)

nodes(object, ...)

# S4 method for class 'igraph'
nodes(object, ...)

edges(object)

edges_(object)

addEdge(v1, v2, object)

removeEdge(v1, v2, object)

Arguments

object

A graph.

op

The operation or query.

set, set2, set3

Sets of nodes in graph.

...

additional arguments

v1, v2

Vertex names

Examples


ug0 <- ug(~a:b + b:c:d + e)

separates("a", "d", c("b", "c"), ug0)
#> [1] TRUE
separates("a", "d", "c", ug0) 
#> [1] FALSE
is.simplicial("b", ug0)
#> [1] FALSE
simplicialNodes(ug0)
#> [1] "a" "c" "d" "e"

simplicialNodes(ug0)
#> [1] "a" "c" "d" "e"