Question

Prove breadth-first search is a special case of uniform-cost search with example

Answer 1

Answer:

Explanation:

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. ... It uses the opposite strategy as depth-first search, which instead explores the highest-depth nodes first before being forced to backtrack and expand shallower nodes.

Answer 2

Answer:

Yes, breadth first search is a special case of uniform-cost search

Explanation:

Breadth first search is a special case of uniform cost search when all the step costs are equal