ConstructTableau[p] performs the bumping algorithm repeatedly on each element of permutation p, resulting in a distinct Young tableau.

CostOfPath[g, p] sums up the weights of the edges in graph g defined by the path p.

Cut is a tag that can be used in a call to NetworkFlow to tell it to return the minimum cut.

Degrees[g] returns the degrees of vertex 1, 2, 3, ... in that order.

DeleteVertices[g, vList] deletes vertices in vList from graph g. vList has the form {i, j, ...}, where i, j, ... are vertex numbers.

Distribution[l, set] lists the frequency of each element of set in list l.

ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.

FindSet[n, s] gives the root of the set containing n in union-find data structure s.

GraphIntersection[g_1, g_2, ...] constructs the graph defined by the edges that are in all the graphs g_1, g_2, ....

GrayCodeKSubsets[l, k] generates k-subsets of l in Gray code order.