# HG changeset patch
# User Robert McIntyre <rlm@mit.edu>
# Date 1328466280 25200
# Node ID da4c47650d3877f2c01a4184e2216c6838a8b92d
# Parent  ecb6e3f9b7d611cf3cb31451a8e8d271dd729ca6
minor edits to types.org

diff -r ecb6e3f9b7d6 -r da4c47650d38 org/types.org
--- a/org/types.org	Sun Feb 05 11:17:14 2012 -0700
+++ b/org/types.org	Sun Feb 05 11:24:40 2012 -0700
@@ -312,9 +312,9 @@
 Therefore, it's prudent to use search.
 
 These functions are a simple implementation of best-first search in
-clojure. The idea to start off with a collection of nodes and some way
-of finding the best node, and to always expand the best node at every
-step.
+clojure. The idea is to start off with a collection of nodes and some
+way of finding the best node, and to always expand the best node at
+every step.
 
 #+srcname: search
 #+begin_src clojure :results silent