Returns a new node to which a given element has been added.
The subset of the entire possible set which this node represents.
The subset of remainingElements which only contains elements larger than every element of includedElements.
The subset of remainingElements which only contains elements larger than every element of includedElements. These are the candidates for addition in the successor nodes.
The complement of includedElements, i.e.
The complement of includedElements, i.e. the elements not yet included in this node.
Used as a node in DFS/BFS for searching through sets. Specifically, the use case is the following:
Starting with the empty set as the root node, various supersets up to certain point are still valid elements and one wishes to to get the largest of these supersets.
E.g.: trying to perform resolution with as many pairs of variables as possible; finding a minimal set cover (with minimality corresponding to validity).