Distribution[l, set] lists the frequency of each element of set in list l.
DodecahedralGraph returns the graph corresponding to the dodecahedron, a Platonic solid.
Edge
(Combinatorica Package Symbol) Edge is an optional argument to inform certain functions to work with edges instead of vertices.
EncroachingListSet[p] constructs the encroaching list set associated with permutation p.
FromInversionVector[v] reconstructs the unique permutation with inversion vector v.
GraphComplement[g] gives the complement of graph g.
GrayCodeSubsets[l] constructs a binary reflected Gray code on set l.
Greedy
(Combinatorica Package Symbol) Greedy is a value that the option Algorithm can take in calls to functions such as VertexCover, telling the function to use a greedy algorithm.
Heapify
(Combinatorica Package Symbol) Heapify[p] builds a heap from permutation p.
HeapSort[l] performs a heap sort on the items of list l.