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 [login to view URL]
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.
Hello Sir...
I am a computer science tutor, I teach (among others) Prolog and Algorithms.
I have done many projects like this, and I'm one of the top Prolog developers, you can check here please: https://www.freelancer.com/freelancers/skills/Prolog/
Please contact me for more details when possible.
I look forward to work for you Sir.
Best Regards.