Completed

Implement in Prolog PageRank

This project was successfully completed by ahmsak for $60 USD in a day.

Get free quotes for a project like this
Employer working
Project Budget
$10 - $30 USD
Completed In
1 day
Total Bids
3
Project Description

Hello, I have to build a prolog program that calculates the pagerank of the graph found in wikipedia.

Implement in Prolog the PageRank algorithm as described at [url removed, login to view]

Test your program with the graph shown in the Wikipedia picture.

Deadline: Thursday Oct 13 at midnight.

Hint: you can reprsent the graph as a predicate edge/2 and the rank as a dynamic predicate rank_of/2 having a vertex as the first argument and its rank the second. You can use assert and retractall to update the ranks at each step.

I have an attempt made for the project but i cant connect all the vertices and nodes. I cant get to calculate the rank of each node. My code starts by calculating the rank of one node. Its missing the iterating code. I might be making it harder that what it sounds.

Completed by:
Skills Required

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online