Which of the following statements is true with respect to either Dijkstra’s algorithm only, A* algorithm only, both algorithms, or neither algorithm. Select the correct option.
a. Operates on a weighted directed pathfinding graph.
O Dijkstra
O A*
O Both
O Neither
b. Finds lowest cost paths from the start node to all other nodes.
O Dijkstra
O A*
O Both
O Neither
c. Searches from node to node along connections.
O Dijkstra
O A*
O Both
O Neither
d. May use Euclidean distance as a heuristic to estimate cost.
O Dijkstra
O A*
O Both
O Neither
e. Tracks nodes’ status as Unvisited, Open, or Closed.
O Dijkstra
O A*
O Both
O Neither
f. Each iteration has a single current node.
O Dijkstra
O A*
O Both
O Neither
g. Stores a complete path to the start node at each visited node.
O Dijkstra
O A*
O Both
O Neither
h. Selects the open node with the smallest cost-so-far as current.
O Dijkstra
O A*
O Both
O Neither
i. May update a node’s cost-so-far if a lower cost path is found.
O Dijkstra
O A*
O Both
O Neither
j. Stores estimated cost to reach goal node at each visited node.
O Dijkstra
O A*
O Both
O Neither