Connectivity components
Finds the connectivity components of a graph.
conComp(amat, method)
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. |
an integer vector representing a partition of the set of nodes.
Giovanni M. Marchetti
Lauritzen, S. (1996). Graphical models. Oxford: Clarendon Press.
## 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))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.