CS 570: Homework #1


Draw your own graph (similar size as the example given in class), 
represent it by using structures. 

	i.) Run it with both, breadth-first search and depth-first 
search engines, and compare the two. (You may wish to compare their
run times using the time primitive. Example:
              * (time (depth-first ...)) 

	ii.) Compare the breadth-first search function 
introduced in class (and used by you for this assignment) with the 
one described in the book (page 30), which is implemented as 
searchnew1.lsp. Modify searchnew1.lisp to do depth-first search.

	iii.) Study the iterative version (page 31) (available as 
searchiter1.lsp). After you understand well how this function works,
get the function search.lsp (from the Boston subway problem), and
submit detailed comments, explaining each form encountered in this 
function.