Remark

For a given permutation group G = < B> on X, one can draw a labeled directed graph, in which an edge (x,y) is labeled g, if g B and g satisfies g(x) = y.

Now the orbits of G on X are the connected components of this graph.

Moreover, a spanning tree of the component containing x is a Schreier tree for B.