conComp: Connectivity components

In ggm: Graphical Markov Models with Mixed Graphs

Description

Finds the connectivity components of a graph.

Usage

conComp(amat, method)

Arguments

amat	a square matrix with dimnames, the adjacency matrix of an UG.
method	an integer 1 or 2 to choose the method used to find the components. Method 2 is more efficient for large graphs.

Value

an integer vector representing a partition of the set of nodes.

Author(s)

Giovanni M. Marchetti

References

Lauritzen, S. (1996). Graphical models. Oxford: Clarendon Press.

See Also

UG

Examples

## three connected components
conComp(UG(~a*c+c*d+e+g*o*u))
## a connected graph
conComp(UG(~ a*b+b*c+c*d+d*a))

ggm documentation built on March 26, 2020, 7:49 p.m.