hard20 pts · first answer countsgraphsdfsbfs

Why use iterative deepening

Iterative deepening DFS runs DFS with depth limit 0, 1, 2, ... until it finds the goal. When is it better than BFS?

A.When edges have different weights, like travel timesB.When you need every path to the goal, not just oneC.When memory is tight: it uses O(depth) memory with similar timeD.When the graph is small enough to fit in a CPU cache

Discussion 0

Join free to post in the discussion.

Why use iterative deepening

Discussion 0

Related questions