compute_ranks v.2

def compute_ranks(graph):
    d = 0.8 # damping factor
    numloops = 10

    ranks = {}
    npages = len(graph)
    for page in graph:
        ranks[page] = 1.0 / npages
    print 'ranks', ranks

    for i in range(0, numloops):
        newranks = {}
        for page in graph:
            newrank = (1 - d) / npages
            for key in graph:
                stash = 0
                if page in graph[key]:
                    stash = stash +(d*ranks[page])/len (graph[key])
                newrank= newrank + stash

            newranks[page] = newrank
        ranks = newranks
        print 'newranks', newranks
    return ranks