final bijna

[ar1516.git] / 1.tex

diff --git a/1.tex b/1.tex
index 585e0cd..ff39c58 100644 (file)
--- a/1.tex
+++ b/1.tex
@@ -83,7 +83,8 @@ listed in Listing~\ref{listing:a1.bash}. The maximization is done by
 incrementing a special variable called \texttt{<REP>} which is an instantiation
 of $n(p)$.  When the iteration yields unsat we know that the current number
 minus one is the maximum amount of prittles the trucks can carry. The
-maximization is done with a bash script shown in Listing~\ref{listing:1.bash}.
+maximization is done with a bash script shown in Listing~\ref{listing:1.bash}
+and visualized with the python script shown in Listing~\ref{listing:a1.py}
 
 \lstinputlisting[language=bash,firstline=66,
        caption={Iteratively find the largest solution for problem 1},