public class Graph.Derived extends Graph implements Child
SubGraph
of the parent()
Graph.
Note that Graph
is abstract but Derived is not —
it sometimes needs a little thought!
(Pre-2015(?) javac was not happy about the use of Derived.)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
Constructor and Description |
---|
Derived() |
Modifier and Type | Method and Description |
---|---|
boolean |
isEdge(int v0,
int v1)
The
parent 's isEdge(v0,v1)
(is very likely to be changed, overridden). |
Graph |
parent()
Returns 'Graph.this', that is, returns the
Graph of which 'this' is a Derivation.
|
Type |
type()
The
parent 's type()
(often the same). |
int |
vSize()
The
parent 's vSize()
(sometimes the same). |
A, adjacent, arrayA, byDegree, byDegree, canonical, canonical1, canonical1R, canonical2, canonical2R, checkProperties, contraction, degree, dense, dense, directPredecessors, directSuccessors, edges, edgesCorrespond, eLabel, 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, vLabel, vLabelled, vLabels, vPair2n