227
edits
Changes
Jump to navigation
Jump to search
'''''Depth-First Search (DFS) approach (IN PROGRESS)''''':
'''***need to fix some problems here: can't keep track of the depth during each iteration***'''
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".
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.
Python file saved in
E:\projects\listing page identifier\Internal_Link\Internal_url_DFS.py
→Site Map Generator
E:\projects\listing page identifier\Internal_Link\Internal_url_BFS.py
===Web Page Screenshot Tool===
