Exercise 1 - PageRank

1. Implement the PageRank Algorithm as discussed in Section 5.1 and 5.2 (Leskovec, Rajaraman & Ullman, 2014) in Python (see Overview module for download instructions). Your implementation should make use of the improvements regarding efficiency and the methods of dealing with dead-ends and spider traps. There are several PageRank implementations available on the web. You have to do your own implementation without using any code from other sources.

2. Run your algorithm on the Google Web Graph 2002 available at http://snap.stanford.edu/data/web-Google.html and provide a file listing the PageRank for each node. Report separately, the ordered list of the ten nodes having the largest PageRank. 

Your approach should be as efficient as possible in terms of runtime and memory requirements.