Here’s a problem that occurs in automatic program analysis. For a set of variables x1,..., xn, you are given some equality constraints, of the form “xi = xj” and some disequality constraints, of the form “xi ≠ xj.” Is it possibl to satisfy all of them?
For instance, the constraints
x1 = x2,x2 = x3, x3 = x4, x1 ≠ x4
cannot be satisfied. Give an efficient algorithm that takes as input m constraints over n variables and decides whether the constraints can be satisfied.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.