Graph Traversal /
Breadth First Search
»
Bread First Search is using queue, not recursion.
When we want to stay close, we use Breadh First Search.
When we want to move far away quickly, we use DFS.
Which data structure uses BFS for traverse?
When we want to stay close to the starting point, what do we use?
When we want to move far away quickly, what do we use?