This PR introduces the capability to generate prime implicants (PIs) for a given set of minterms. Prime implicants are a fundamental component in boolean minimization algorithms such as the Quine-McCluskey method.
Key Features:
Efficient generation of PIs from a list of minterms.
The introduction of essential data structures for minterms and implicants.
Changes:
Added the generatePrimeImplicants function which takes a list of minterms and returns a list of prime implicants.
Incorporated necessary data structures: Minterm and Implicant.
Improved and optimized the minterm combination process for generating PIs.
Testing:
The new functionality has been rigorously tested with various test cases to ensure correctness. Additional unit tests have been added to verify the integrity of the prime implicant generation process.
This PR introduces the capability to generate prime implicants (PIs) for a given set of minterms. Prime implicants are a fundamental component in boolean minimization algorithms such as the Quine-McCluskey method.
Key Features:
Changes:
Testing:
The new functionality has been rigorously tested with various test cases to ensure correctness. Additional unit tests have been added to verify the integrity of the prime implicant generation process.