Depth$-$first search, where the neighbors are expanded in alphabetic ordering

$($b$)$ Breadth$-$first search

$($c$)$ Lowest$-$cost$-$first search $($

$$

$$

with

$$

$$

$($

$$

$)$

$=$

$0$

for all nodes

$$

$)$

$($d$)$

$$

$$

with

$$

$$

$($

$$

$)$

$=$

$|$

$$

$$

$($

$$

$)$

$$

$$

$$

$($

$$

$)$

$|$

$+$

$|$

$$

$$

$($

$$

$)$

$$

$$

$$

$($

$$

$)$

$|$

$($the

$$

$-$distance plus

$$

$-$distance from

$$

to

$$

$),$ where

$$

$$

$($

$$

$)$

$=$

$0$

$,$

$$

$$

$($

$$

$)$

$=$

$1$

$,$

$$

$$

$($

$$

$)$

$=$

$0$

$,$

$$

$$

$($

$$

$)$

$=$

$1$

$,$

$$

$$

$($

$$

$)$

$=$

$2$

$,$

$$

$$

$($

$$

$)$

$=$

$2$

$,$

$$

$$

$($

$$

$)$

$=$

$1$

$,$

$$

$$

$($

$$

$)$

$=$

$1$

$,$

$$

$$

$($

$$

$)$

$=$

$0$

$,$ and

$$

$$

$($

$$

$)$

$=$

$0$

$.$