blocks to divide and conquer, and optimizes
traversing order. See Van der Loo (2012) for a
description of the algorithms.generateEdits(E)editarraylist, where element E is
an editarray containing all generated
edits. nodes contains information on the number of
nodes in the tree and vs the number of nodes traversed
and duration contains user, system and elapsed
time inseconds. The summary
method for editarray prints this
information.M.P.J. Van der Loo (2012). Variable elimination and edit generation with a flavour of semigroup algebra (submitted)