graph

Class Directed.AsUndirected

java.lang.Object

la.la.Value

graph.Graph

graph.Undirected

graph.Directed.AsUndirected

All Implemented Interfaces:

Child, Graph.SubGraph, java.lang.Comparable<Value>

Enclosing class:

Directed

public class Directed.AsUndirected
extends Undirected
implements Graph.SubGraph

Ignore the directions of the Edges in 'this' Directed Graph to create an Undirected version; in general there is a loss of information. If this Directed is Edge-labelled, "prefer" a label of ⟨v0, v1⟩ where v0≤v1. Also see Undirected.asDirected().

Nested Class Summary

Nested classes/interfaces inherited from class graph.Undirected

Undirected.AsDirected, Undirected.Dense, Undirected.Edge, Undirected.K, Undirected.Sparse, Undirected.Vertex

Nested classes/interfaces inherited from class graph.Graph

Graph.Canonical, Graph.Contraction, Graph.Derived, Graph.Induced, Graph.Renumbered, Graph.SubGraph, Graph.SubGraphs, Graph.ToDirected, Graph.ToUndirected

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

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

Field Summary

Fields inherited from class graph.Undirected

unlabelled, unlabelled_O

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
AsUndirected()

Method Summary

Modifier and Type	Method and Description
Value	eLabel(int v0, int v1) UnsupportedOperation, the default assumption is no Edge labels.
boolean	isEdge(int v0, int v1) Is ⟨v0, v1⟩ an Edge in 'this' Graph? Also see adjacent(v0,v1).
Directed	parent() Return the parent Graph of which 'this' is a Child.
java.lang.String	toString() Used, for example, in printing of constants, and in calls to Value.error(java.lang.String).
Type	type() Note, type(), Graph.adjacent(int, int), Graph.vLabelled(), Graph.vLabel(int), Graph.eLabelled(), and Graph.eLabel(int, int) must be consistent.
int	v2pv(int v) Vertex 'v' of 'this' Graph corresponds to v2pv(v) of the parent Graph.
Value	vLabel(int v) UnsupportedOperation, the default assumption is no Vertex labels.
int	vSize() The number of Vertices, |V|≥1, V = {v0, ..., v(vSize()-1)}, of 'this' Graph.

Methods inherited from class graph.Undirected

adjacent, asDirected, degree, dense, dense, dense, dense, dense, dense, main, sparse, toUndirected, upperRightA

Methods inherited from class graph.Graph

A, arrayA, byDegree, byDegree, canonical, canonical1, canonical1R, canonical2, canonical2R, checkProperties, contraction, directPredecessors, directSuccessors, edges, edgesCorrespond, eLabelled, eLabels, eSize, eStats, flatten, hashCode, inDegree, induced, isDirected, isomorphic, isUndirected, joinedTo, localHash, maxEdges, nAutomorphisms, outDegree, randomised, renumbered, selfLoops, structurallyIdentical, subGraphs, subGraphs, toDirected, vLabelled, vLabels, vPair2n

Methods inherited from class la.la.Value

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

Methods inherited from class java.lang.Object

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

Constructor Detail

AsUndirected

public AsUndirected()

Method Detail

parent

public Directed parent()

Description copied from interface: Child

Return the parent Graph of which 'this' is a Child.

Specified by:

parent in interface Child

v2pv

public int v2pv(int v)

Description copied from interface: Graph.SubGraph

Vertex 'v' of 'this' Graph corresponds to v2pv(v) of the parent Graph.

Specified by:

v2pv in interface Graph.SubGraph

type

public Type type()

Description copied from class: Graph

Note, type(), Graph.adjacent(int, int), Graph.vLabelled(), Graph.vLabel(int), Graph.eLabelled(), and Graph.eLabel(int, int) must be consistent.

Specified by:

type in class Graph

vSize

public int vSize()

Description copied from class: Graph

The number of Vertices, |V|≥1, V = {v₀, ..., v_(vSize()-1)}, of 'this' Graph. The "null Graph" (|V|=0) is usually considered not to be a Graph. Also see eSize().

Specified by:

vSize in class Graph

isEdge

public boolean isEdge(int v0,
                      int v1)

Description copied from class: Graph

Is ⟨v0, v1⟩ an Edge in 'this' Graph? Also see adjacent(v0,v1).

Specified by:

isEdge in class Graph

vLabel

public Value vLabel(int v)

Description copied from class: Graph

UnsupportedOperation, the default assumption is no Vertex labels. Also see vLabelled() and eLabel(v0,v1).

Overrides:

vLabel in class Graph

eLabel

public Value eLabel(int v0,
                    int v1)

Description copied from class: Graph

UnsupportedOperation, the default assumption is no Edge labels. Also see eLabelled() and vLabel(v).

Overrides:

eLabel in class Graph

toString

public java.lang.String toString()

Description copied from class: Value

Used, for example, in 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).

Overrides:

toString in class Value