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.

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

MaximumAntichain[g] gives a largest set of unrelated vertices in partial order g.

MaximumIndependentSet[g] finds a largest independent set of graph g.

MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.