, including all inherited members.
| assumptions | hittingsetalg.MinHittingSets | [protected] |
| attemptedPruneNode | hittingsetalg.MinHittingSets | [protected] |
| attemptPrune(HSNode node) | hittingsetalg.MinHittingSets | [inline, protected] |
| callTheoremProver(SortedIntList edgeLabels) | hittingsetalg.MinHittingSets | [inline, protected] |
| canClose(HSNode node) | hittingsetalg.MinHittingSets | [inline, protected] |
| checkMinimalityHS() | hittingsetalg.MinHittingSets | [inline] |
| components | hittingsetalg.MinHittingSets | [protected] |
| computationState | hittingsetalg.MinHittingSets | [protected] |
| compute(int maxHSSize, int maxNumMinHS) | hittingsetalg.MinHittingSets | [inline] |
| computedMinHS | hittingsetalg.MinHittingSets | [protected] |
| computeIncr | hittingsetalg.MinHittingSets | [protected] |
| computeLabel(HSNode node) | hittingsetalg.MinHittingSets | [inline, protected] |
| computeMore(int newMaxHSSize, int newMaxNumMinHS) | hittingsetalg.MinHittingSets | [inline] |
| computeNumUnprunedChildren(HSNode node) | hittingsetalg.MinHittingSets | [inline, protected] |
| conflictsAreMinimal | hittingsetalg.MinHittingSets | [protected] |
| conflictSets | hittingsetalg.MinHittingSets | [protected] |
| CS_ALL_MIN_DIAGS_COMPUTED | hittingsetalg.MinHittingSets | [static] |
| CS_COMPUTING | hittingsetalg.MinHittingSets | [protected, static] |
| CS_MAX_HS_SIZE_REACHED | hittingsetalg.MinHittingSets | [static] |
| CS_MAX_NUM_MIN_HS_REACHED | hittingsetalg.MinHittingSets | [static] |
| expandNode(HSNode node, LinkedList newNodes, int lastLevel) | hittingsetalg.MinHittingSets | [inline, protected] |
| getConflictsAsAss() | hittingsetalg.MinHittingSets | [inline] |
| getMinHS() | hittingsetalg.MinHittingSets | [inline] |
| getMinHSAsIntLists() | hittingsetalg.MinHittingSets | [inline] |
| hitsAllConflictSets() | hittingsetalg.MinHittingSets | [inline] |
| levels | hittingsetalg.MinHittingSets | [protected] |
| maxHSSize | hittingsetalg.MinHittingSets | [protected] |
| maxNumMinHS | hittingsetalg.MinHittingSets | [protected] |
| MinHittingSets(boolean conflictsAreMinimal, ArrayList conflictSets) | hittingsetalg.MinHittingSets | [inline] |
| MinHittingSets(boolean conflictsAreMinimal, ABTheoremProver tp) | hittingsetalg.MinHittingSets | [inline] |
| nodeInvariant(HSNode node) | hittingsetalg.MinHittingSets | [inline, protected] |
| processLastLevel(int lastLevel, LinkedList lastLevelNodes, LinkedList newLevelNodes, boolean expandNodes) | hittingsetalg.MinHittingSets | [inline, protected] |
| prune(HSNode node, HSNode prunedParent) | hittingsetalg.MinHittingSets | [inline, protected] |
| relabel(HSNode node, HSNode newNode) | hittingsetalg.MinHittingSets | [inline, protected] |
| rootNode | hittingsetalg.MinHittingSets | [protected] |
| searchRefutingCS(SortedIntList edgeLabel) | hittingsetalg.MinHittingSets | [inline, protected] |
| theoremProver | hittingsetalg.MinHittingSets | [protected] |