Saved Bookmarks
| 1. |
How Depth First Traversal Works? |
|
Answer» Depth First SEARCH algorithm(DFS) traverses a GRAPH in a depthward motion and uses a stack to remember to GET the NEXT vertex to start a search when a dead end occurs in any ITERATION. Depth First Search algorithm(DFS) traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search when a dead end occurs in any iteration. |
|