Introduction - If you have any usage issues, please Google them yourself
The QM algorithm is an algorithm used to minimize the Kano map. The idea is that the number of 1 of the implying items is grouped and only 1 of the implication items with a difference of 1 may be adjacent, so that all the main implication items can be given out through the cycle.