By taking a branch headed by Youngstown in the existing major-node tree, the heuristic search algorithm expands this branch as shown in Figure 5. the algorithm finds the best alternative : Youngstown => Columbus => Toledo => Ann Arbor.