LoopΒΆ

graph.spad line 1008 [edit on github]

This is used with graph theory code (FiniteGraph, DirectedGraph. FunctionGraph, and so on) to represent a loop as either a sequence of vertex or arrow indexes depending on context. The main benefit is that the loop is stored in a canonical way so that loops can be quickly compared using '='.

=: (%, %) -> Boolean

from BasicType

~=: (%, %) -> Boolean

from BasicType

coerce: % -> OutputForm

from CoercibleTo OutputForm

entries: % -> List NonNegativeInteger

entries(lp) returns list of indexes that make this loop

hash: % -> SingleInteger

from SetCategory

hashUpdate!: (HashState, %) -> HashState

from SetCategory

latex: % -> String

from SetCategory

loop: List NonNegativeInteger -> %

loop(li) constructs loop from list of indexes li

BasicType

CoercibleTo OutputForm

SetCategory