graph-clique | R Documentation |

Return a list of (maximal) cliques of an undirected graph.

```
get_cliques(object)
max_cliqueMAT(amat)
getCliques(object)
maxCliqueMAT(amat)
maxClique(object)
```

`object` |
An undirected graph represented either as a |

`amat` |
An adjacency matrix. |

In graph theory, a clique is often a complete subset of a graph. A maximal clique is a clique which can not be enlarged. In statistics (and that is the convention we follow here) a clique is usually understood to be a maximal clique.

Finding the cliques of a general graph is an NP complete problem. Finding the cliques of triangualted graph is linear in the number of cliques.

The workhorse is the `max_cliqueMAT`

function which calls the
`maxClique`

function in the `RBGL`

package.

A list.

For backward compatibility with downstream packages we have the following synonymous functions:

getCliques = get_cliques

maxCliqueMAT = max_cliqueMAT

Søren Højsgaard, sorenh@math.aau.dk

`ug`

, `dag`

, `mcs`

,
`mcsMAT`

, `rip`

, `ripMAT`

,
`moralize`

, `moralizeMAT`

```
## graphNEL
uG0 <- ug(~a:b + b:c + c:d + d:e + e:f + f:a) # a graphNEL object
get_cliques(uG0)
uG1 <- as(uG0, "igraph")
get_cliques(uG1)
uG2 <- as(uG0, "matrix")
get_cliques(uG2)
uG3 <- as(uG1, "dgCMatrix")
get_cliques(uG3)
```

gRbase documentation built on Sept. 22, 2023, 5:12 p.m.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.