Preorder(S)

logic.spad line 593 [edit on github]

• S : SetCategory

implies operation with reflexivity and transitivity for more documentation see: htm

+ : (%, %) -> %

from FiniteGraph(S)

= : (%, %) -> Boolean

from BasicType

addArrow! : (%, Record(name : String, arrType : NonNegativeInteger, fromOb : NonNegativeInteger, toOb : NonNegativeInteger, xOffset : Integer, yOffset : Integer, map : List(NonNegativeInteger))) -> %

from FiniteGraph(S)

addArrow! : (%, String, S, S) -> %

from FiniteGraph(S)

addArrow! : (%, String, NonNegativeInteger, NonNegativeInteger) -> %

from FiniteGraph(S)

addArrow! : (%, String, NonNegativeInteger, NonNegativeInteger, List(NonNegativeInteger)) -> %

from FiniteGraph(S)

addObject! : (%, S) -> %

from FiniteGraph(S)

addObject! : (%, Record(value : S, posX : NonNegativeInteger, posY : NonNegativeInteger)) -> %

from FiniteGraph(S)

adjacencyMatrix : % -> Matrix(NonNegativeInteger)

from FiniteGraph(S)

arrowName : (%, NonNegativeInteger, NonNegativeInteger) -> String

from FiniteGraph(S)

arrowsFromArrow : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

arrowsFromNode : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

arrowsToArrow : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

arrowsToNode : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

coerce : % -> OutputForm

from CoercibleTo(OutputForm)

createWidth : NonNegativeInteger -> NonNegativeInteger

from FiniteGraph(S)

createX : (NonNegativeInteger, NonNegativeInteger) -> NonNegativeInteger

from FiniteGraph(S)

createY : (NonNegativeInteger, NonNegativeInteger) -> NonNegativeInteger

from FiniteGraph(S)

cycleClosed : (List(S), String) -> %

from FiniteGraph(S)

cycleOpen : (List(S), String) -> %

from FiniteGraph(S)

deepDiagramSvg : (String, %, Boolean) -> Void

from FiniteGraph(S)

diagramHeight : % -> NonNegativeInteger

from FiniteGraph(S)

diagramSvg : (String, %, Boolean) -> Void

from FiniteGraph(S)

diagramWidth : % -> NonNegativeInteger

from FiniteGraph(S)

diagramsSvg : (String, List(%), Boolean) -> Void

from FiniteGraph(S)

distance : (%, NonNegativeInteger, NonNegativeInteger) -> Integer

from FiniteGraph(S)

distanceMatrix : % -> Matrix(Integer)

from FiniteGraph(S)

flatten : DirectedGraph(%) -> %

from FiniteGraph(S)

getArrowIndex : (%, NonNegativeInteger, NonNegativeInteger) -> NonNegativeInteger

from FiniteGraph(S)

getArrows : % -> List(Record(name : String, arrType : NonNegativeInteger, fromOb : NonNegativeInteger, toOb : NonNegativeInteger, xOffset : Integer, yOffset : Integer, map : List(NonNegativeInteger)))

from FiniteGraph(S)

getVertexIndex : (%, S) -> NonNegativeInteger

from FiniteGraph(S)

getVertices : % -> List(Record(value : S, posX : NonNegativeInteger, posY : NonNegativeInteger))

from FiniteGraph(S)

inDegree : (%, NonNegativeInteger) -> NonNegativeInteger

from FiniteGraph(S)

incidenceMatrix : % -> Matrix(Integer)

from FiniteGraph(S)

initial : () -> %

from FiniteGraph(S)

isAcyclic? : % -> Boolean

from FiniteGraph(S)

isDirectSuccessor? : (%, NonNegativeInteger, NonNegativeInteger) -> Boolean

from FiniteGraph(S)

isDirected? : () -> Boolean

from FiniteGraph(S)

isFixPoint? : (%, NonNegativeInteger) -> Boolean

from FiniteGraph(S)

isFunctional? : % -> Boolean

from FiniteGraph(S)

isGreaterThan? : (%, NonNegativeInteger, NonNegativeInteger) -> Boolean

from FiniteGraph(S)

kgraph : (List(S), String) -> %

from FiniteGraph(S)

laplacianMatrix : % -> Matrix(Integer)

from FiniteGraph(S)

latex : % -> String

from SetCategory

le : (%, NonNegativeInteger, NonNegativeInteger) -> Boolean

le(s, x, y) checs if x is less than or equal to y. I would have liked to have used: "<=" instead of "le" "<=" compiles but when called gives: Internal Error: The function <= with signature hashcode is missing from domain.

loopsArrows : % -> List(Loop)

from FiniteGraph(S)

loopsAtNode : (%, NonNegativeInteger) -> List(Loop)

from FiniteGraph(S)

loopsNodes : % -> List(Loop)

from FiniteGraph(S)

looseEquals : (%, %) -> Boolean

from FiniteGraph(S)

map : (%, List(NonNegativeInteger), List(S), Integer, Integer) -> %

from FiniteGraph(S)

mapContra : (%, List(NonNegativeInteger), List(S), Integer, Integer) -> %

from FiniteGraph(S)

max : % -> NonNegativeInteger

from FiniteGraph(S)

max : (%, List(NonNegativeInteger)) -> NonNegativeInteger

from FiniteGraph(S)

merge : (%, %) -> %

from FiniteGraph(S)

min : % -> NonNegativeInteger

from FiniteGraph(S)

min : (%, List(NonNegativeInteger)) -> NonNegativeInteger

from FiniteGraph(S)

nodeFromArrow : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

nodeFromNode : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

nodeToArrow : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

nodeToNode : (%, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

outDegree : (%, NonNegativeInteger) -> NonNegativeInteger

from FiniteGraph(S)

routeArrows : (%, NonNegativeInteger, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

routeNodes : (%, NonNegativeInteger, NonNegativeInteger) -> List(NonNegativeInteger)

from FiniteGraph(S)

spanningForestArrow : % -> List(Tree(Integer))

from FiniteGraph(S)

spanningForestNode : % -> List(Tree(Integer))

from FiniteGraph(S)

spanningTreeArrow : (%, NonNegativeInteger) -> Tree(Integer)

from FiniteGraph(S)

spanningTreeNode : (%, NonNegativeInteger) -> Tree(Integer)

from FiniteGraph(S)

subdiagramSvg : (Scene(SCartesian(2)), %, Boolean, Boolean) -> Void

from FiniteGraph(S)

terminal : S -> %

from FiniteGraph(S)

unit : (List(S), String) -> %

from FiniteGraph(S)

~= : (%, %) -> Boolean

from BasicType

FiniteGraph(S)

BasicType

CoercibleTo(OutputForm)

SetCategory