This is a very bad idea. The algorithm that examines conflicts is quadratic in time. For functions with lots of registers, you get a very large, sparce matrix. Using a symmetric matrix saves us a linear time factor of about 64, since we can scan a row of the matrix one word at a time.