227
edits
Changes
Jump to navigation
Jump to search
we We examine all pages(nodes) at the same depth before going down to the next depth.
we We visit a page(node) "A" and then all A's children on the current path will be visited before we visit A's neighbor node "B".
→Site Map Generator
'''''Breadth-First Search (BFS) approach''''':
Python file saved in
'''''Depth-First Search (DFS) approach''''':
For example, assuming the furthest depth a user wants to dig in is 2, we will start with our homepage and then examine its first child node "page 1", then visiting page 1's children until we meet the maximum depth. Then we move onto homepage's second child "page 2" and visit page 2's children until we reach the maximum depth. Next we visit homepage's next child and so on.
