karjudev

from typing import Dict, List

def pagerank(G: Dict[int, List[int]], v: Dict[int, float] = None,
            alpha: float = 0.85, max_iter: int = 1000,
            tol: float = 10e-12) -> Dict[int, float]:
    # Number of nodes in the graph
    n = len(G)
    # Removes self loops from the graph
    for i in G:
        if i in G[i]:

karjudev

Keybase proof

I hereby claim:

• I am karjudev on github.
• I am karjudev (https://keybase.io/karjudev) on keybase.
• I have a public key ASC6lqkWzz_we8zlZJTCdxK5DIlsbQGMOnmEmCOrlEah4Ao

To claim this, I am signing this object: