RankBinarySubset[l, s] gives the rank of subset s of set l in the ordering of subsets of l, obtained by interpreting these subsets as binary string representations of ...

RankGraph[g, l] partitions the vertices into classes based on the shortest geodesic distance to a member of list l.

RankGrayCodeSubset[l, s] gives the rank of subset s of set l in the Gray code ordering of the subsets of l.

RankKSubset[s, l] gives the rank of k-subset s of set l in the lexicographic ordering of the k-subsets of l.

RankPermutation[p] gives the rank of permutation p in lexicographic order.

RankRGF[f] returns the rank of a restricted growth function (RGF) f in the lexicographic order of all RGFs.

RankSetPartition[sp, s] ranks sp in the list of all set partitions of set s. RankSetPartition[sp] ranks sp in the list of all set partitions of the set of elements that ...

RankSubset[l, s] gives the rank, in canonical order, of subset s of set l.

ReadGraph[f] reads a graph represented as edge lists from file f and returns a graph object.

RealizeDegreeSequence[s] constructs a semirandom graph with degree sequence s.