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

CyclicGroup[n] returns the cyclic group of permutations on n symbols.

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

DeleteFromTableau[t, r] deletes the last element of row r from Young tableau t.

Derangements[p] constructs all derangements of permutation p.

DistinctPermutations[l] gives all permutations of the multiset described by list l.

Edge is an optional argument to inform certain functions to work with edges instead of vertices.

EquivalenceClasses[r] identifies the equivalence classes among the elements of matrix r.

EulerianCycle[g] finds an Eulerian cycle of g if one exists.

ExactRandomGraph[n, e] constructs a random labeled graph of exactly e edges and n vertices.