An A/sup */-like And/or Graph Search Algorithm --- Algorithm AO.A

Abstract

This paper establishes the isomorphic correspondence between concepts of graphs, and concepts of generalized And/Or graphs (GAG,it includes standard And/Or graph) . By this correspondence, the perfect theory, algorithms and analysis methods of graph search can be transferred to GAG search successfully . Taking A/sup */ as an example , we describe a GAG search algorithm AO.A/sup */ , which is transferred from graph search algorithm A/sup */ and we analyze its properties also. Some shortcoming of G. Levi 's definition about complexity of GAG search algorithms is pointed out and a new complexity definition is proposed.