III. LINK ANALYSIS ALGORITHMS In the development of web search, link analysis, hyperlink analysis and the graphic structure of the Web have been useful, which is one of the factors considered by web search engines in calculating a composite ranking for a web page on a given user query. The directed graph setup is known as a web graph. There are several algorithms based on link analysis. The important algorithms are Hypertext Induced Topic Search (HITS), Page Rank, Weighted Page Rank and Weighted Page Content Rank.A. HITSHITS algorithm stands for Hypertext Induced Topic Search. It is a link-based algorithm that is used to rank pages retrieved from the web based on the specified user query based on their textual information. When the user retrieves the requested pages, the HITS algorithm begins to ignore the textual information and begins to focus only on the structure of the web. In [13], the algorithm is used to rank relevant pages and treat all links equally for the distribution of ranking scores. . In this, HITS classifies pages by analyzing their incoming and outgoing links. Web pages pointing to hyperlinks are known as hubs, but hyperlinks pointing to web pages are known as authorities. Let ap and hp represent the authority and hub scores of page p, respectively. B (p) and I (p) indicate the set of reference and reference pages of page p, respectively. The hub and authority scores are calculated as follows: In [14], HITS provides the root set by taking the first n pages, then embeds the root set with the web pages linked to it and the web pages linked from it to form the basic set. The web pages and links included in the core set are used to form the secondary graph. In this paper,...... middle of the paper...... is the link weight(v, u) calculated based on the number of outbound links of the page u and the number of outbound links of all page references of page v [14]. where Ou and Op represent the number of outgoing links of page u and page p respectively. R(v) denotes the reference page list of page v. To calculate the rank in the WPR algorithm: In [13], the proposed system represents the evaluation of the weighted page algorithm where the work done as:• In this, website with number of hyperlinks is necessarily found because this algorithm it is based on the web structure. • Next a required web map is generated for the selected website. • Then a set of relevant pages with the specified user query are retrieved using the search engine. The relevant set of pages is called the root set.• Pages point directly to or are pointed to by pages in the root set creates a base set.