K = completeGraph R
K = completeGraph(R,n)
K = completeGraph L
This function returns a special graph, the complete graph. The input specifies a set of vertices that will have the property that every vertex is adjacent to every other vertex. Non-specified vertices are treated as isolated vertices.
|
|
|
|
The object completeGraph is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/EdgeIdeals.m2:2119:0.