public static class Directed.C extends Directed.Sparse
Directed.Sparse.Induced, Directed.Sparse.RenumberedDirected.AsUndirected, Directed.C, Directed.Dense, Directed.Edge, Directed.Sparse, Directed.VertexGraph.Canonical, Graph.Contraction, Graph.Derived, 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.Tuplees, pred, succunlabelled, unlabelled_O| Constructor and Description |
|---|
C(int n)
The number of Vertices in the Graph and in the cycle.
|
| Modifier and Type | Method and Description |
|---|---|
java.lang.String |
toString()
|
directPredecessors, directSuccessors, eSize, inDegree, induced, isEdge, joinedTo, maxV, outDegree, renumbered, type, vSizeasUndirected, degree, dense, dense, dense, dense, dense, dense, main, sparse, toDirectedA, adjacent, arrayA, byDegree, byDegree, canonical, canonical1, canonical1R, canonical2, canonical2R, checkProperties, contraction, edges, edgesCorrespond, eLabel, eLabelled, eLabels, eStats, flatten, hashCode, isDirected, isomorphic, isUndirected, localHash, maxEdges, nAutomorphisms, randomised, selfLoops, structurallyIdentical, subGraphs, subGraphs, toUndirected, vLabel, vLabelled, vLabels, vPair2npublic 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 Directed.Sparse