summaryrefslogtreecommitdiff
path: root/docs/closest_apple.tex
diff options
context:
space:
mode:
Diffstat (limited to 'docs/closest_apple.tex')
-rw-r--r--docs/closest_apple.tex2
1 files changed, 2 insertions, 0 deletions
diff --git a/docs/closest_apple.tex b/docs/closest_apple.tex
index 36b7382..b00768d 100644
--- a/docs/closest_apple.tex
+++ b/docs/closest_apple.tex
@@ -10,4 +10,6 @@ To find the shortest path, we need to use an algorithm called
\emph{breadth first search} (BFS).
% TODO: description of the algorithm
+\ifshowcode
\pythonfile{closest_apple.py}
+\fi