Saved Bookmarks
| 1. |
How Breadth First Traversal Works? |
|
Answer» Breadth First Search algorithm(BFS) traverses a graph in a breadthwards motion and USES a queue to remember to GET the NEXT vertex to START a search when a dead end occurs in any iteration. Breadth First Search algorithm(BFS) traverses a graph in a breadthwards motion and uses a queue to remember to get the next vertex to start a search when a dead end occurs in any iteration. |
|