In preparation for code that will allow splitting the computation into parts, introduced a variant of the generator class FrankKasperExtended that can be made to simply count the number of stage 1 candidates (i.e. combinations of equivariant simplices).
In preparation for code that will allow splitting the computation into parts, introduced a variant of the generator class FrankKasperExtended that can be made to simply count the number of stage 1 candidates (i.e. combinations of equivariant simplices).


BackupTheBerlios/gavrog,BackupTheBerlios/gavrog,BackupTheBerlios/gavrog,BackupTheBerlios/gavrog,BackupTheBerlios/gavrog