diff options
| author | Peter Ward <peteraward@gmail.com> | 2013-07-18 20:18:33 +1000 |
|---|---|---|
| committer | Peter Ward <peteraward@gmail.com> | 2013-07-18 20:18:33 +1000 |
| commit | 86c88670ea757cee11864ec00e6819726c65473a (patch) | |
| tree | 6d7a24abf2661b80df72fe8d0e53d72f5193ec09 /docs/closest_apple.tex | |
| parent | a08792ddb7ffeed3e1d376248777a5f7c010bd67 (diff) | |
conditionally show the code
Diffstat (limited to 'docs/closest_apple.tex')
| -rw-r--r-- | docs/closest_apple.tex | 2 |
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 |