Double coset enumeration of symmetrically generated groups

Many finite groups, including all non-abelian finite simple groups, can be symmetrically generated by involutions. An algorithm is described which resembles the familiar Todd-Coxeter enumeration of single cosets and which performs a double coset enumeration for a group defined in this manner. Several rather small examples are worked by hand, and computer input and output is given for more interesting cases.