Which concept is defined as follows: a graph traversal algorithm that explores all neighbors at the current depth before moving deeper?

Question

Accepted Answer

B. Breadth-first search (BFS) — Breadth-first search (BFS) refers to a graph traversal algorithm that explores all neighbors at the current depth before moving deeper.

Answer

A. Depth-first search (DFS)

Answer

B. Breadth-first search (BFS)

Answer

C. Big O notation

Answer

D. Divide and conquer

Which concept is defined as follows: a graph traversal algorithm that explores all neighbors at the current depth before moving deeper?

Correct answer

Explanation