Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
How can I programatically resolve this type of system :
A = !B
B = !C
D = !B
E = !A
E = !B
so I can get by substituting A = C = D (3) and E = B (2). I only need the number of the 2 groups. If it’s not possible to get 2 groups, I display an error message.
In case, this is not closed as a dupe, from my answer in your previous question:
To solve equations of the form
Form a graph with nodes as Xi and connecting Xi and X j iff the equation Xi = NOT X j appears.
Now try to 2-colour the graph using Breadth First Search.