deletions | additions       diff --git a/subsection_A_B_Since_A__.tex b/subsection_A_B_Since_A__.tex  index 900abe4..ce0ebe4 100644  --- a/subsection_A_B_Since_A__.tex  +++ b/subsection_A_B_Since_A__.tex 
...
\begin{quote}  The nodes of the graph correspond to variables of the problem, and a link connects any two variables that participate in a constraint.  \end{quote}  Assuming that we have no other arcs to process, the following is the constraint graph constructed:  \node A  \node B  \node C  \subsection{. \((A, B)\)}  Since \(A = B + 1\) is the constraint, Domain \(D_A\) will be reduced to \{1, 2, 3, 4\} to be make arc \((A, B)\) arc-consistent. 
...
\(D_B = \{0, 2\}\)  \(D_C = \{0, 1\}\)  Assuming that we have no other arcs to process, the following is the constraint graph constructed: