this is for holding javascript data
Huang Lie Jun edited On_constraint_graph_begin_quote__.tex
about 8 years ago
Commit id: 7617791c6a4e4d8e4461a25efcfa82cc01730487
deletions | additions
diff --git a/On_constraint_graph_begin_quote__.tex b/On_constraint_graph_begin_quote__.tex
index 2c80c81..5a62101 100644
--- a/On_constraint_graph_begin_quote__.tex
+++ b/On_constraint_graph_begin_quote__.tex
...
[A]---[B]---[C]
\subsection{. \begin{enumerate}
\item \((A,
B)\)} B)\)
\end{enumerate}
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.
State:
...
\(D_C = \{0, 1, 2, 3, 4\}\)
\subsection{. \begin{enumerate}
\item \((B,
A)\)} A)\)
\end{enumerate}
Since \(B = A - 1\) is the constraint, Domain \(D_B\) will be reduced to \{0, 1, 2, 3\} to be make arc \((B, A)\) arc-consistent.
State:
...
\(D_C = \{0, 1, 2, 3, 4\}\)
\subsection{. \begin{enumerate}
\item \((B,
C)\)} C)\)
\end{enumerate}
Since \(B = 2C\) is the constraint, Domain \(D_B\) will be reduced to \{0, 2\} to be make arc \((B, C)\) arc-consistent.
State:
...
\(D_C = \{0, 1, 2, 3, 4\}\)
\subsection{. \begin{enumerate}
\item \((C,
B)\)} B)\)
\end{enumerate}
Since \(C = \frac{B}{2}\) is the constraint, Domain \(D_C\) will be reduced to \{0, 1\} to be make arc \((C, B)\) arc-consistent.
State:
