||User can run only one step of algorithm.
Alhorithm is initialized if it is the first time it is being run.
If the halting condition is fulfilled, MBA will generate and present result rules.
This part of progam is realized by NextStep() procedure. At the beginning it takes next large set from frequentedSets. This large set is used for generating of new large sets and it is obtained by frequentedSets.getActual(). In program it is called This set is unioned with all single-member sets which contain member bigger than the biggest member of actual large set. Such new set is inserted into candidateSets repository. When the actual set is unioned with all appropriate large single-member sets, check of candidates begin.
Support (which is # of occurences of candidate set/# of rows) is found out and compared with MinSupp variable. If the support is bigger, candidate is copied to the frequentedSets repository. Actual item is inserted to the tree structure of treeForm.If flag ShowAllNodes is set to true then small candidates are inserted to the tree structure and displayed on treeForm.