public class Graph.Renumbered extends Graph.Derived implements Graph.SubGraph
vs[]
.
Also see renumbered
.Graph.Canonical, Graph.Contraction, Graph.Dense, Graph.Derived, Graph.Edge, Graph.Induced, Graph.Renumbered, Graph.Sparse, Graph.SubGraph, Graph.SubGraphs, Graph.ToDirected, Graph.ToUndirected, Graph.Vertex
Value.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 |
---|---|
int[] |
vs
Vertex 'v' of 'this' is Vertex vs[v] of the
parent() Graph. |
Constructor and Description |
---|
Renumbered(int[] vs)
vs must be a permutation of
|
Modifier and Type | Method and Description |
---|---|
int |
degree(int v)
The
parent 's degree(vs[v]). |
Value |
eLabel(int v0,
int v1)
The
parent 's eLabel(vs[v0],isEdge[v1]). |
boolean |
isEdge(int v0,
int v1)
The
parent 's isEdge(vs[v0],isEdge[v1]). |
java.lang.String |
toString()
|
int |
v2pv(int v)
Vertex 'v' in 'this' Renumbered is Vertex vs[v] of
the
parent() Graph. |
Value |
vLabel(int v)
The
parent 's vLabel(vs[v]), if any. |
parent, type, vSize
A, adjacent, arrayA, byDegree, byDegree, canonical, canonical1, canonical1R, canonical2, canonical2R, checkProperties, contraction, dense, dense, directPredecessors, directSuccessors, edges, edgesCorrespond, eLabelled, eLabels, eSize, eStats, flatten, hashCode, inDegree, induced, isDirected, isomorphic, isUndirected, joinedTo, localHash, main, maxEdges, nAutomorphisms, outDegree, randomised, renumbered, selfLoops, structurallyIdentical, subGraphs, subGraphs, toDirected, toUndirected, vLabelled, vLabels, vPair2n
AoM, apply, bOp, compareTo, cons, cts, elt, errMsg, error, force, isTuple, just, n, nElts, nlAoM, pair, print, quad, real, RTE, triple, tuple, UOE, uOp, x
public final int[] vs
parent()
Graph. vs must be a
permutation of public Renumbered(int[] vs)
public int v2pv(int v)
parent()
Graph.v2pv
in interface Graph.SubGraph
public boolean isEdge(int v0, int v1)
parent
's isEdge(vs[v0],isEdge[v1]).isEdge
in class Graph.Derived
public java.lang.String toString()
Value
printing
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)
.