graph

Class Type

java.lang.Object

la.la.Value

la.la.Value.Structured

la.la.Value.Option

la.la.Type

la.la.Type.Structured

graph.Type

All Implemented Interfaces:

java.lang.Comparable<Value>

public class Type
extends Type.Structured

The class of Graph Types. It specifies Directed?, selfLoops?, and Vertex- & Edge- labelling.

Nested Class Summary

Nested classes/interfaces inherited from class la.la.Type

Type.Atomic, Type.Char, Type.Cts, Type.Discrete, Type.Enum, Type.Function, Type.Int, Type.Model, Type.Option, Type.Structured, Type.Triv, Type.Tuple, Type.TYPE, Type.Vector

Nested classes/interfaces inherited from class la.la.Value.Option

Value.Option.GP

Nested classes/interfaces inherited from class la.la.Value

Value.Bool, Value.Chars, Value.Defer, Value.Inc_Or, Value.Lambda, Value.List, Value.Maybe, Value.Real, Value.Scannable

Field Summary

Fields

Modifier and Type	Field and Description
Type	eType Does the Graph have Vertex- and/or Edge- labels, and if so, of what Type(s)?
boolean	isDirected Is the Graph Directed, and are self-loops allowed?
boolean	selfLoops Is the Graph Directed, and are self-loops allowed?
Type	vType Does the Graph have Vertex- and/or Edge- labels, and if so, of what Type(s)?

Fields inherited from class la.la.Type

BOOL, BOOL_N, CHAR, CHAR_N, CHARS, CTS, CTS_N, DNA, ENUM_N, FUNCTION, FUNCTION_N, INC_OR, INT, INT_N, LIST, MATRIX_CTS, MATRIX_INT, MAYBE, MODEL, MODEL_N, name, OPTION_N, PAIR, TRIPLE, TRIV, TRIV_N, TUPLE_N, TYPE, TYPE_N, VECTOR, VECTOR_CHARS, VECTOR_CTS, VECTOR_INT, VECTOR_N

Fields inherited from class la.la.Value

C, comparator, CR, E, eight, ffalse, five, fiveR, four, fourR, half, negCR, negOne, negOneR, negTenR, nilVal, nine, None, one, oneR, PI, PIby2, point01, point1, point5, point9, quarter, seven, six, ten, tenR, three, threeR, triv, ttrue, two, twoR, zero, zeroR

Constructor Summary

Constructors

Constructor and Description
Type(boolean isDirected) Construct a Graph Type with no Vertex or Edge label Types, that is unlabelled.
Type(java.lang.String name, boolean isDirected) Assumes no self-loops, and not Vertex- or Edge- labelled.
Type(java.lang.String name, boolean isDirected, boolean selfLoops) Assumes not Vertex- or Edge- labelled.
Type(java.lang.String name, boolean isDirected, boolean selfLoops, Type vType, Type eType) Construct a Graph Type with specified isDirected(?), selfLoops(?), Vertex label Type 'vType', and Edge label Type 'eType.

Method Summary

Modifier and Type	Method and Description
boolean	checkProperties(Graph g) Check that Graph 'g' does satisfy the requirements of 'this' Type.
Type	clone(boolean isDirected) Return a "cloned" Type but with 'isDirected' set as indicated.
Value	elt(int i) 0:isDirected, 1:selfLoops, 2:vType, 3:eType.
int	maxEdges(int vSize) What is the maximum number of Edges for a Graph of this Type with 'vSize' Vertices? (If allowed, a self-loop counts as one.)
int	n() Return this Option Value's number within its Option Type.
int	nElts() Four, see elt(i).
boolean	ni(Value g) Does Graph g belong to (satisfy) 'this' Graph Type?

Methods inherited from class la.la.Type

appendSB, contains, main, show, show, toString, tuple, type

Methods inherited from class la.la.Value.Option

closes, compareTo, opens, separator

Methods inherited from class la.la.Value.Structured

AoM, elts, frth, fst, nlAoM, print, snd, thrd

Methods inherited from class la.la.Value

apply, bOp, cons, cts, errMsg, error, force, isTuple, just, pair, quad, real, RTE, triple, tuple, UOE, uOp, x

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

isDirected

public final boolean isDirected

Is the Graph Directed, and are self-loops allowed?

selfLoops

public final boolean selfLoops

Is the Graph Directed, and are self-loops allowed?

vType

public final Type vType

Does the Graph have Vertex- and/or Edge- labels, and if so, of what Type(s)?

eType

public final Type eType

Does the Graph have Vertex- and/or Edge- labels, and if so, of what Type(s)?

Constructor Detail

Type

public Type(boolean isDirected)

Construct a Graph Type with no Vertex or Edge label Types, that is unlabelled.

Type

public Type(java.lang.String name,
            boolean isDirected)

Assumes no self-loops, and not Vertex- or Edge- labelled.

Type

public Type(java.lang.String name,
            boolean isDirected,
            boolean selfLoops)

Assumes not Vertex- or Edge- labelled.

Type

public Type(java.lang.String name,
            boolean isDirected,
            boolean selfLoops,
            Type vType,
            Type eType)

Construct a Graph Type with specified isDirected(?), selfLoops(?), Vertex label Type 'vType', and Edge label Type 'eType.

Method Detail

ni

public boolean ni(Value g)

Does Graph g belong to (satisfy) 'this' Graph Type?

Overrides:

ni in class Type

clone

public Type clone(boolean isDirected)

Return a "cloned" Type but with 'isDirected' set as indicated.

maxEdges

public int maxEdges(int vSize)

What is the maximum number of Edges for a Graph of this Type with 'vSize' Vertices? (If allowed, a self-loop counts as one.)

checkProperties

public boolean checkProperties(Graph g)

Check that Graph 'g' does satisfy the requirements of 'this' Type. I.e., check for symmetry of Undirected Graphs, and absence of ⟨v,v⟩ of ¬selfLoops. O(|V|²)-time.

n

public int n()

Description copied from class: Value.Option

Return this Option Value's number within its Option Type.

Specified by:

n in class Value.Option

nElts

public int nElts()

Four, see elt(i).

Overrides:

nElts in class Type

elt

public Value elt(int i)

0:isDirected, 1:selfLoops, 2:vType, 3:eType.

Overrides:

elt in class Type