Breadth-first search is considered to be optimal when?
A). there is less number of nodes
B). all step costs are unequal
C). all step costs are equal
D). None of these
Answer:C
Breadth-first search is considered to be optimal when?
A). there is less number of nodes B). all step costs are unequal C). all step costs are equal D). None of these