HamiltonianPath[g] finds a Hamiltonian path in graph g if one exists. HamiltonianPath[g, All] gives all Hamiltonian paths of graph g.

Heapify[p] builds a heap from permutation p.

HeapSort[l] performs a heap sort on the items of list l.

IcosahedralGraph returns the graph corresponding to the icosahedron, a Platonic solid.

InitializeUnionFind[n] initializes a union-find data structure for n elements.

Josephus[n, m] generates the inverse of the permutation defined by executing every m\[Null]^th member in a circle of n members.

LeviGraph returns the unique (8, 3)-cage, a 3-regular graph whose girth is 8.

LNorm[p] is a value that the option WeightingFunction, used in the function SetEdgeWeights, can take. Here p can be any integer or Infinity.

LowerLeft is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

LowerRight is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.