Abstract
We present an efficient algorithm for determining the orbits of a G-set using only a set of generators of the group. Examples of combinatorics, graph theory, and group theory are provided to illustrate possible applications of the algorithm.
Keywords: