graph

Class Directed

java.lang.Object

la.la.Value

graph.Graph

graph.Directed

All Implemented Interfaces:

java.lang.Comparable<Value>

Direct Known Subclasses:

Directed.Dense, Directed.Sparse, Graph.ToDirected, Undirected.AsDirected

public abstract class Directed
extends Graph

The class of Directed Graphs. Operations on Directed Graphs, and special Directed Graphs. Also see Undirected and Graph.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	Directed.AsUndirected Ignore the directions of the Edges in 'this' Directed Graph to create an Undirected version; in general there is a loss of information.
static class	Directed.C The class of Cyclic Directed Graphs of the form v0 → v1 → ...
static class	Directed.Dense A Dense, Directed Graph with Type t and adjacency Matrix A.
class	Directed.Edge Also see Undirected.Edge.
static class	Directed.Sparse The class of Sparse Directed Graphs.
class	Directed.Vertex Also see 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

Modifier and Type	Field and Description
static Type	unlabelled The standard type of Directed (directed, no self-loop) Graphs.
static Type	unlabelled_O Type of Directed, unlabelled, self-loops (O) allowed Graphs.

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

Method Summary

Modifier and Type	Method and Description
Directed.AsUndirected	asUndirected() Convenience function.
int	degree(int v) inDegree(v)+outDegree(v) (a self-loop ⟨v,v⟩ is counted twice).
static Directed.Dense	dense(boolean selfLoops, int[][] A) dense(t,A).
static Directed.Dense	dense(boolean selfLoops, Matrix A) dense(t,A).
static Directed.Dense	dense(int[][] A) dense(false,A) -- no self-loops.
static Directed.Dense	dense(Matrix A) dense(false, A) -- no self-loops.
static Directed.Dense	dense(Type t, int[][] A) dense(t,ints(A)).
static Directed.Dense	dense(Type t, Matrix A) Return a Dense Directed Graph having Type 't' and Adjacency Matrix 'A'.
static void	main(java.lang.String[] argv) See Test.main(java.lang.String[]).
static Directed.Sparse	sparse(Type t, int V, int[][] es) Convenience function.
Directed	toDirected() Identity function; see Graph.toDirected().

Methods inherited from class graph.Graph

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

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, toString, triple, tuple, UOE, uOp, x

Methods inherited from class java.lang.Object

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

Field Detail

unlabelled

public static final Type unlabelled

The standard type of Directed (directed, no self-loop) Graphs.

unlabelled_O

public static final Type unlabelled_O

Type of Directed, unlabelled, self-loops (O) allowed Graphs.

Constructor Detail

Directed

public Directed()

Method Detail

degree

public int degree(int v)

inDegree(v)+outDegree(v) (a self-loop ⟨v,v⟩ is counted twice).

Overrides:

degree in class Graph

toDirected

public Directed toDirected()

Identity function; see Graph.toDirected().

Overrides:

toDirected in class Graph

asUndirected

public Directed.AsUndirected asUndirected()

Convenience function.

dense

public static Directed.Dense dense(Type t,
                                   Matrix A)

Return a Dense Directed Graph having Type 't' and Adjacency Matrix 'A'. Also see Undirected.dense(graph.Type, la.maths.Matrix) and Graph.dense(graph.Type, la.maths.Matrix).

dense

public static Directed.Dense dense(boolean selfLoops,
                                   Matrix A)

dense(t,A). 'selfLoops' specifies if Graphs are allowed to have self-loops, not if this Graph actually has any.

dense

public static Directed.Dense dense(Matrix A)

dense(false, A) -- no self-loops.

dense

public static Directed.Dense dense(Type t,
                                   int[][] A)

dense(t,ints(A)).

dense

public static Directed.Dense dense(boolean selfLoops,
                                   int[][] A)

dense(t,A).

dense

public static Directed.Dense dense(int[][] A)

dense(false,A) -- no self-loops.

sparse

public static Directed.Sparse sparse(Type t,
                                     int V,
                                     int[][] es)

Convenience function.

main

public static void main(java.lang.String[] argv)

See Test.main(java.lang.String[]).