# Complete set of exhaustive sets.

### Description

This function implements the algorithm in Figure 1, Garcia and Herrera (2008) to create, given a set, the complete set of exhaustive sets E.

### Usage

1 | ```
exhaustiveSets(set)
``` |

### Arguments

`set` |
Set to create the exhaustive sets. The complexity of this algorithm is huge, so use with caution for sets of more than 7-8 elements. Indeed, the implementation, as it is, can be hardly used from sizes beyond 9. |

### Details

The algorithm makes use of 'exhaustive.sets', a structure provided with the pacakge that contains the precomputed sets for size up to 9. With this structure the exhaustive sets are generated inmediately, but if the data is, for some reason, not loaded, the computation may take several hours (or even days, depending on the size of the set).

### Value

A list with all the possible exhaustive sets, without repetitions.

### Examples

1 | ```
exhaustiveSets(c("A","B","C","D"))
``` |