Question

You are hungry and want pizza!

However, you are in a city where you've never been. The only things you have: Your wits, your nose, and a badly drawn map of all restaurant districts in your city. Each restaurant district may or may not have a pizza place.

Your strategy is to visit each restaurant district, starting with the closest ones. You'll wander up and down the district, following your nose. If you smell pizza (or something that smells like pizza), you follow it. Otherwise, you will path around randomly within the district avoiding places where you have already been. After a set amount of effort spent within one district, if you have not found a pizza place, you will move to the next district.

Your pizza searching algorithm most closely resembles...

Select the best option:
A.
Dijkstra's Algorithm

B.
Depth First Search

C.
A* Search

D.
Kruskal's Algorithm

E.
Traveling Salesman Algorithm​

Answer 1

Answer:

ok tq. can u plss mark me as brainliest

Explanation:

Answer 2

Answer:

DFS

Explanation:

Not sure, but seems like DFS