Update app.py

app.py

@@ -38,8 +38,8 @@ def visualize(df_pairwise: pd.DataFrame) -> Figure:
 
 
 # https://gist.github.com/dustalov/41678b70c40ba5a55430fa5e77b121d9#file-bradley_terry-py
-def bradley_terry(wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_],
-                  seed: int = 0, tolerance: float = 10e-6, limit: int = 20) -> npt.NDArray[np.float_]:
+def bradley_terry(wins: npt.NDArray[np.int64], ties: npt.NDArray[np.int64],
+                  seed: int = 0, tolerance: float = 10e-6, limit: int = 20) -> npt.NDArray[np.float64]:
     M = wins + .5 * ties
 
     T = M.T + M
@@ -73,7 +73,7 @@ def bradley_terry(wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_],
 
 
 def centrality(algorithm: Callable[[nx.DiGraph], dict[int, float]],
-               wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_]) -> npt.NDArray[np.float_]:
+               wins: npt.NDArray[np.int64], ties: npt.NDArray[np.int64]) -> npt.NDArray[np.float64]:
     A = wins + .5 * ties
 
     G = nx.from_numpy_array(A, create_using=nx.DiGraph)
@@ -85,33 +85,31 @@ def centrality(algorithm: Callable[[nx.DiGraph], dict[int, float]],
     return p
 
 
-def counting(wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_],
-             seed: int = 0, tolerance: float = 10e-6, limit: int = 100) -> npt.NDArray[np.float_]:
+def counting(wins: npt.NDArray[np.int64], ties: npt.NDArray[np.int64],
+             seed: int = 0, tolerance: float = 10e-6, limit: int = 100) -> npt.NDArray[np.float64]:
     M = wins + .5 * ties
 
-    return cast(npt.NDArray[np.float_], M.sum(axis=1))
+    return cast(npt.NDArray[np.float64], M.sum(axis=1))
 
 
-def eigen(wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_],
-          seed: int = 0, tolerance: float = 10e-6, limit: int = 100) -> npt.NDArray[np.float_]:
+def eigen(wins: npt.NDArray[np.int64], ties: npt.NDArray[np.int64],
+          seed: int = 0, tolerance: float = 10e-6, limit: int = 100) -> npt.NDArray[np.float64]:
     algorithm = partial(nx.algorithms.eigenvector_centrality_numpy, max_iter=limit, tol=tolerance)
 
     return centrality(algorithm, wins, ties)
 
 
-def pagerank(wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_],
-             seed: int = 0, tolerance: float = 10e-6, limit: int = 100) -> npt.NDArray[np.float_]:
+def pagerank(wins: npt.NDArray[np.int64], ties: npt.NDArray[np.int64],
+             seed: int = 0, tolerance: float = 10e-6, limit: int = 100) -> npt.NDArray[np.float64]:
     algorithm = partial(nx.algorithms.pagerank, max_iter=limit, tol=tolerance)
 
     return centrality(algorithm, wins, ties)
 
 
 # https://gist.github.com/dustalov/41678b70c40ba5a55430fa5e77b121d9#file-newman-py
-def newman(wins: npt.NDArray[np.int_], ties: npt.NDArray[np.int_],
-           seed: int = 0, tolerance: float = 10e-6, limit: int = 20) -> npt.NDArray[np.float_]:
-    rng = np.random.default_rng(seed)
-
-    pi, v = rng.random(wins.shape[0]), rng.random()
+def newman(wins: npt.NDArray[np.int64], ties: npt.NDArray[np.int64],
+           seed: int = 0, tolerance: float = 10e-6, limit: int = 20) -> npt.NDArray[np.float64]:
+    pi, v = np.ones(wins.shape[0]), .5
 
     converged, iterations = False, 0