Breadth-first search expands all states at one depth before moving deeper. It finds a fewest-edge path in an unweighted graph but can consume substantial memory.

Breadth-First Search Finds Shallow Unweighted Paths

In this situation—finding the fewest prerequisite hops from basics to a target concept—which choice best applies “Breadth-First Search Finds Shallow Unweighted Paths”?

A shortest-path algorithm minimizes the sum of edge costs, so costs must represent the desired tradeoff and meet algorithm assumptions. Fewest steps, lowest latency, and lowest risk are different objectives.

Learn Before

Related