Implement the Breadth$-$first traversal with a goal using the code for Depth$-$first traversal with a goal.

The program output:

Directed graph

$[1]--158------$

$[2]--------379$

$[3]------------4$

$[4]------------5$

$[5]--------------$

$[6]--------------$

$[7]--------------$

Breadth$-$first traversal $1234567$

Breadth$-$first traversal $1234567$ goal found, the search path is $1-2-7$ and the cost is $10$

Breadth$-$first traversal $1234567$ goal not found!

Depth$-$first traversal $1256734$

Depth$-$first traversal $12567$ goal found, the search path is $1-2-7$ and the cost is $10$

Depth$-$first traversal $1256734$ goal not found!

Directed graph

$[1]--524----------$

$[2]--------94------$

$[3]--------------6--$

$[4]------------2----$

$[5]----------------5$

$[6]--------------6--$

$[7]--------------1--$

$[8]------------------$

$[9]------------------$

Breadth$-$first traversal $123456879$

Breadth$-$first traversal $1234568$ goal found, the search path is $1-3-8$ and the cost is $8$

Breadth$-$first traversal $123456879$ goal not found!

Depth$-$first traversal $125968347$

Depth$-$first traversal $125968$ goal found, the search path is $1-2-6-8$ and the cost is $15$

Depth$-$first traversal $125968347$ goal not found!