227
edits
Changes
Jump to navigation
Jump to search
'''Note''': the recommended maximum depth input is 2. Since our primary goal is to capture the screenshot of the portfolio page (client listing page) and this page often appears at the first depth, if not, second depth will be enough to achieve the goal, no need to dive deeper than the second depth.
→Algorithm on Collecting Internal Links
[[File:WebPageTree.png|700px|thumb|center|Site Map Tree]]
'''Intuitions:'''
*We treat each internal page as a tree node
*Each node can have multiple linked children or none
*Taking the above picture as an example, the homepage is the first tree node (at depth = 0) that we will be given as an input to our function, and it has 4 children (at depth = 1): page 1, page 2, page 3, and page 4
*Given the above idea, we have built 2 following algorithms to find all internal links of a web page with 2 user inputs: homepage url and depth
'''Note:''' the recommended maximum depth input is 2. Since our primary goal is to capture the screenshot of the portfolio page (client listing page) and this page often appears at the first depth, if not, second depth will be enough to achieve the goal, no need to dive deeper than the second depth.
'''''Breadth-First Search (BFS) approach''''':
E:\projects\listing page identifier\Internal_Link\Internal_url_DFS.py
===Web Page Screenshot Tool (IN PROGRESS)===
