The only difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a queue instead of a stack to manage the traversal.

Question

Quizplus · Accepted Answer

Depth-first traversal uses a stack (or recursion) to explore as far as possible along each branch before backtracking, while breadth-first traversal uses a queue to explore all neighbors at the present depth prior to moving on to nodes at the next depth level. The order of node exploration is different, not just the data structure used.

The Only Difference Between a Depth-First Traversal of a Graph