C = getCliques(G,d)
C = getCliques G
A clique of a graph is a subset of its vertices which induces a complete subgraph. That is, a set of vertices is a clique if every pair of vertices in the set forms an edge of the graph. This function returns all cliques of a specified size, and if no size is given, it returns all cliques. Note that all the edges of the graph are considered cliques of size two.
|
|
|
|
|
The object getCliques is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/EdgeIdeals.m2:2553:0.