Assume the following graph depicts a part of the Web, where nodes represent page

Question

Assume the following graph depicts a part of the Web, where nodes represent pages and edges show hyper-links. Find out the pages whose PageRank values are greater than zero and their relative PageRank values in the graph. You do not need to perform the fix point computation to determine the PageRank values. Instead, you should guess the PageRank values based on your understanding of the PageRank algorithm and explain why you think they are correct. If it is no 1 possible to make any educated guess for some page(s), you should explain why

Explanation / Answer

As such we know that page ranking is defined for the directed graphs but not for the undirected graphs..here directly we cant make a educated guess on the undirected graph to know the page ranking but instead we have to convert the undirected graph into directed graph to determine the page ranking of each page greater than zero.each edge in the undirected graph is replaced by two edges in the directed graph.because ranking ranks the pages on the basis of of incoming links..

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.