Update Tree-Search-and-Graph-Search.md

norvig · web-flow · commit 33032b31bffc · 2019-02-06T20:11:30.000-08:00
diff --git a/md/Tree-Search-and-Graph-Search.md b/md/Tree-Search-and-Graph-Search.md
@@ -1,15 +1,15 @@
-# GENERIC-SEARCH
+# GRAPH-SEARCH
 
 ## AIMA4e
 
 
-__function__ GENERIC-SEARCH(_problem_) __returns__ a solution, or failure  
+__function__ GRAPH-SEARCH(_problem_) __returns__ a solution, or failure  
 &emsp;_frontier_ &larr; a queue initially containing one path, for the _problem_'s initial state  
 &emsp;_reached_ &larr; a table of {_state_: the best path that reached _state_}; initially empty  
 &emsp;_solution_ &larr; failure  
 &emsp;__while__  _frontier_ is not empty __and__ _solution_ can possibly be improved __do__  
 &emsp;&emsp;&emsp;_parent_ &larr; some node that we choose to remove from _frontier_  
-&emsp;&emsp;&emsp;__for__ _child_ __in__ successors(_parent_) __do__   
+&emsp;&emsp;&emsp;__for__ _child_ __in__ Expand(_parent_) __do__   
 &emsp;&emsp;&emsp;&emsp;&emsp;_s_ &larr; _child_.state  
 &emsp;&emsp;&emsp;&emsp;&emsp;__if__ _s_ is not in _reached_  __or__ _child_ is a cheaper path than _reached_[_s_] __then__  
 &emsp;&emsp;&emsp;&emsp;&emsp;&emsp;&emsp;_reached_[_s_] &larr; _child_  
