Learning project based on Quine-Mc.Cluskey logic optimisation method i learned here at the ULB. The goal is for me to learn about programming in Rust so the code may not be optimised / may be completely dumb.
- Accept 0 to 255 as minterms
- Produce all the tables containing every combination possible by the rule of the method, free of duplicate.
- Indicate if a combination has been used in a further table
- Do the synthesis phase
- print result in a file
Not intensively tested so it might contain errors with the combination