Thinning[image] finds the skeletons of foreground regions in image by applying morphological thinning until convergence.Thinning[image, n] performs n iterations of ...

AntiSymmetricQ[g] yields True if the adjacency matrix of g represents an anti-symmetric binary relation.

CompleteBinaryTree[n] returns a complete binary tree on n vertices.

MultiplicationTable[l, f] constructs the complete transition table defined by the binary relation function f on the elements of list l.

NextBinarySubset[l, s] constructs the subset of l following subset s in the order obtained by interpreting subsets as binary string representations of integers.

RankBinarySubset[l, s] gives the rank of subset s of set l in the ordering of subsets of l, obtained by interpreting these subsets as binary string representations of ...

ReflexiveQ[g] yields True if the adjacency matrix of g represents a reflexive binary relation.

SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.

TreeToCertificate[t] returns a binary string that is a certificate for the tree t such that trees have the same certificate if and only if they are isomorphic.

UnrankBinarySubset[n, l] gives the n\[Null]^th subset of list l, listed in increasing order of integers corresponding to the binary representations of the subsets.