public static class Undirected.K extends Undirected.Dense
Undirected.AsDirected, Undirected.Dense, Undirected.Edge, Undirected.K, Undirected.Sparse, Undirected.VertexGraph.Canonical, Graph.Contraction, Graph.Derived, Graph.Induced, Graph.Renumbered, Graph.SubGraph, Graph.SubGraphs, Graph.ToDirected, Graph.ToUndirectedValue.Atomic, Value.Bool, Value.Char, Value.Chars, Value.Cts, Value.Defer, Value.Discrete, Value.Enum, Value.Inc_Or, Value.Int, Value.Lambda, Value.List, Value.Maybe, Value.Option, Value.Real, Value.Scannable, Value.Structured, Value.Triv, Value.Tuple| Modifier and Type | Field and Description |
|---|---|
protected int |
n
The
number of Vertices. |
unlabelled, unlabelled_O| Constructor and Description |
|---|
K(int n)
Construct the complete Undirected Graph on 'n' Vertices.
|
| Modifier and Type | Method and Description |
|---|---|
java.lang.String |
toString()
|
isEdge, type, vSizeadjacent, asDirected, degree, dense, dense, dense, dense, dense, dense, main, sparse, toUndirected, upperRightAA, arrayA, byDegree, byDegree, canonical, canonical1, canonical1R, canonical2, canonical2R, checkProperties, contraction, directPredecessors, directSuccessors, edges, edgesCorrespond, eLabel, eLabelled, eLabels, eSize, eStats, flatten, hashCode, inDegree, induced, isDirected, isomorphic, isUndirected, joinedTo, localHash, maxEdges, nAutomorphisms, outDegree, randomised, renumbered, selfLoops, structurallyIdentical, subGraphs, subGraphs, toDirected, vLabel, vLabelled, vLabels, vPair2nprotected final int n
number of Vertices.public java.lang.String toString()
Valueprinting of
constants, and in calls to Value.error(java.lang.String).
The result does not necessarily fully specify a large, or
infinite(!), Value. (This default returns the Class Name of 'this'.)
Also see print(ps).toString in class Undirected.Dense