227
edits
Changes
Jump to navigation
Jump to search
*'''Breadth-First Search(BFS)approach''': we examine all pages(nodes) at the same depth before going down to the next depth.
*'''Depth-First Search (DFS) approach''': we visit a page(node) and then all its children on the current path will be visited before we examining this page neighbor node.
→Site Map Generator
*Given the above idea, we have built 2 following algorithms to find all internal links of a web page with 2 given user inputs: homepage url and depth
E:\projects\listing page identifier\Internal_Link\Internal_url_BFS.py
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 children "page 1", then visiting page 1's children until we meet the maximum depth. Then we move onto homepage's second children "page 2" and visit page 2's children until we reach the maximum depth. Next we visit homepage next children page 3 and so on.
E:\projects\listing page identifier\Internal_Link\Internal_url_DFS.py
