## First Implementation and Test

\[10 points\] Implement the iterative PageRank algorithm. Test your code on the six-node example using the input representation given above. Be sure that your code handles pages that have no in-links or out-links properly. (You may wish to test on a few such examples.) In later parts of this assignment, depending on how you store the data, it may be convenient to use iterators rather than storing the data in memory.

# TODO: \ # distribution over nodes, run a fixed number of iterations, and # return a distribution over nodes.

def page_rank_fixed_iter(nodes, edges, iterations=10): return page_rank

# Output PageRank on the toy graph at various points. # Make sure your output has node number, name, and PageRank value. page_rank_fixed_iter(small_nodes, small_edges, 1) page_rank_fixed_iter(small_nodes, small_edges, 10) page_rank_fixed_iter(small_nodes, small_edges, 100)