Consider the graph given below. What is the order in which the nodes mentioned in the options are to be traversed to find the shortest path from A to Z using best first search?

A. Node-A

B. Node-B

C. Node-C

D. Node-D

E. Node-E

Choose the correct answer from the options given below:

1. AA → C → F → D → E
2. BA → C → E → B
3. CA → C → F → E → B
4. DA → C → D → F

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. A → C → F → D → E

Explanation

Expanding the cheapest frontier node each time: A; C (2); F via C (2 + 3 = 5); D (6); E (6 + 2 = 8); then Z (12). So nodes are expanded in the order A → C → F → D → E.