توليد مصفوفات تغطية متسلسلة بلغة جافا

Generating a sequ3nce covering arrays using algorithms is used to test a system for accuracy and safety from errors by achieving complete coverage and with the least number of tests that achieve the full combinations, which are the interactions between a number of inputs. We consider the inputs to be numbers from 5 to 10, assuming that they are five, meaning there are five factors, three of which interact with each other in different but sequential interactions. The Algorithiis illustrated and written in C++ from NIST conducted tests for an increasing number of elements each time with the stability of interactions by 3 or 4, which is called t-way, and published the results in a table. I would like to implement the code in Java, giving details of the test execution and size as in the NIST table attached below. This represents only a conversion from a ready-made C++ model to Java, while maintaining the same results using the greedy algorithm to generate sequences or tests, and then improving this algorithm so that the size of the tests in the array is reduced (while maintaining coverage of all t-way combinations) as well as reducing the execution time.

If the idea succeeds, we will work on other algorithms and improve the performance as well, by developing data structures and merging one algorithm with another by taking advantage of their properties in reducing.

The attachments below are a comprehensive guide about the idea as well as project related