scikit-network 0.31.0__cp310-cp310-win_amd64.whl → 0.33.0__cp310-cp310-win_amd64.whl

sknetwork/visualization/tests/test_graphs.py

@@ -1,6 +1,6 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
-"""tests for visualization/graphs.py"""
+"""tests for visualization of graphs"""
 
 import tempfile
 import unittest
@@ -10,7 +10,7 @@ from scipy import sparse
 
 from sknetwork.data.test_graphs import test_disconnected_graph, test_bigraph_disconnect
 from sknetwork.data.toy_graphs import karate_club, painters, movie_actor, bow_tie, star_wars
-from sknetwork.visualization.graphs import svg_graph, svg_bigraph, svg_text, rescale
+from sknetwork.visualization.graphs import visualize_graph, visualize_bigraph, svg_graph, svg_bigraph, svg_text, rescale
 
 
 # noinspection DuplicatedCode
@@ -21,74 +21,77 @@ class TestVisualization(unittest.TestCase):
         adjacency = graph.adjacency
         position = graph.position
         labels = graph.labels
+        image = visualize_graph(adjacency, position, labels=labels)
+        self.assertEqual(image[1:4], 'svg')
+        # alias
         image = svg_graph(adjacency, position, labels=labels)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, labels=list(labels))
+        image = visualize_graph(adjacency, position, labels=list(labels))
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, display_edges=False)
+        image = visualize_graph(adjacency, position, display_edges=False)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, height=None)
+        image = visualize_graph(adjacency, position, height=None)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, height=300, width=None)
+        image = visualize_graph(adjacency, position, height=300, width=None)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, height=None, width=200)
+        image = visualize_graph(adjacency, position, height=None, width=200)
         self.assertEqual(image[1:4], 'svg')
         n = adjacency.shape[0]
         edge_labels = [(0, 1, 0), (1, 1, 1), (3, 10, 2)]
-        image = svg_graph(adjacency, position=None, names=np.arange(n), labels=np.arange(n), scores=np.arange(n),
-                          seeds=[0, 1], width=200, height=200, margin=10, margin_text=5, scale=3,
-                          node_order=np.flip(np.arange(n)),
-                          node_size=5, node_size_min=2, node_size_max=6, display_node_weight=True,
-                          node_weights=np.arange(n),
-                          node_width=2, node_width_max=5, node_color='red', edge_width=2, edge_width_min=2,
-                          edge_width_max=4, edge_color='blue', edge_labels=edge_labels, display_edge_weight=True,
-                          font_size=14)
+        image = visualize_graph(adjacency, position=None, names=np.arange(n), labels=np.arange(n), scores=np.arange(n),
+                                seeds=[0, 1], width=200, height=200, margin=10, margin_text=5, scale=3,
+                                node_order=np.flip(np.arange(n)),
+                                node_size=5, node_size_min=2, node_size_max=6, display_node_weight=True,
+                                node_weights=np.arange(n),
+                                node_width=2, node_width_max=5, node_color='red', edge_width=2, edge_width_min=2,
+                                edge_width_max=4, edge_color='blue', edge_labels=edge_labels, display_edge_weight=True,
+                                font_size=14)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position=None, labels={0: 0})
+        image = visualize_graph(adjacency, position=None, labels={0: 0})
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position=None, scores={0: 0})
+        image = visualize_graph(adjacency, position=None, scores={0: 0})
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency=None, position=position)
+        image = visualize_graph(adjacency=None, position=position)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency=None, position=position, edge_labels=edge_labels)
+        image = visualize_graph(adjacency=None, position=position, edge_labels=edge_labels)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, labels, label_colors={0: "red", 1: "blue"})
+        image = visualize_graph(adjacency, position, labels, label_colors={0: "red", 1: "blue"})
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, labels, label_colors=["red", "blue"])
+        image = visualize_graph(adjacency, position, labels, label_colors=["red", "blue"])
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, labels, node_weights=np.arange(adjacency.shape[0]))
+        image = visualize_graph(adjacency, position, labels, node_weights=np.arange(adjacency.shape[0]))
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, scores=list(np.arange(n)))
+        image = visualize_graph(adjacency, position, scores=list(np.arange(n)))
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, seeds={0: 1, 2: 1})
+        image = visualize_graph(adjacency, position, seeds={0: 1, 2: 1})
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, labels=np.arange(n), name_position='left')
+        image = visualize_graph(adjacency, position, labels=np.arange(n), name_position='left')
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, scale=2, labels=np.arange(n), name_position='left')
+        image = visualize_graph(adjacency, position, scale=2, labels=np.arange(n), name_position='left')
         self.assertEqual(image[1:4], 'svg')
         with self.assertRaises(ValueError):
-            svg_graph(adjacency, position, labels=[0, 1])
+            visualize_graph(adjacency, position, labels=[0, 1])
         with self.assertRaises(ValueError):
-            svg_graph(adjacency, position, scores=[0, 1])
-        svg_graph(adjacency, position, scale=2, labels=np.arange(n), name_position='left')
+            visualize_graph(adjacency, position, scores=[0, 1])
+        visualize_graph(adjacency, position, scale=2, labels=np.arange(n), name_position='left')
 
     def test_directed(self):
         graph = painters(True)
         adjacency = graph.adjacency
         position = graph.position
         names = graph.names
-        image = svg_graph(adjacency, position, names=names)
+        image = visualize_graph(adjacency, position, names=names)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_graph(adjacency, position, display_edges=False)
+        image = visualize_graph(adjacency, position, display_edges=False)
         self.assertEqual(image[1:4], 'svg')
         n = adjacency.shape[0]
-        image = svg_graph(adjacency, position=None, names=np.arange(n), labels=np.arange(n), scores=np.arange(n),
-                          name_position='below', seeds=[0, 1], width=200, height=200, margin=10, margin_text=5,
-                          scale=3, node_order=np.flip(np.arange(n)),
-                          node_size=5, node_size_min=2, node_size_max=6, display_node_weight=True,
-                          node_weights=np.arange(n),
-                          node_width=2, node_width_max=5, node_color='red', edge_width=2, edge_width_min=2,
-                          edge_width_max=4, edge_color='blue', display_edge_weight=True, font_size=14)
+        image = visualize_graph(adjacency, position=None, names=np.arange(n), labels=np.arange(n), scores=np.arange(n),
+                                name_position='below', seeds=[0, 1], width=200, height=200, margin=10, margin_text=5,
+                                scale=3, node_order=np.flip(np.arange(n)),
+                                node_size=5, node_size_min=2, node_size_max=6, display_node_weight=True,
+                                node_weights=np.arange(n),
+                                node_width=2, node_width_max=5, node_color='red', edge_width=2, edge_width_min=2,
+                                edge_width_max=4, edge_color='blue', display_edge_weight=True, font_size=14)
         self.assertEqual(image[1:4], 'svg')
 
     def test_bipartite(self):
@@ -96,54 +99,57 @@ class TestVisualization(unittest.TestCase):
         biadjacency = graph.biadjacency
         names_row = graph.names_row
         names_col = graph.names_col
+        image = visualize_bigraph(biadjacency, names_row, names_col)
+        self.assertEqual(image[1:4], 'svg')
+        # alias
         image = svg_bigraph(biadjacency, names_row, names_col)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_bigraph(biadjacency, display_edges=False)
+        image = visualize_bigraph(biadjacency, display_edges=False)
         self.assertEqual(image[1:4], 'svg')
-        image = svg_bigraph(biadjacency, reorder=False)
+        image = visualize_bigraph(biadjacency, reorder=False)
         self.assertEqual(image[1:4], 'svg')
         n_row, n_col = biadjacency.shape
         position_row = np.random.random((n_row, 2))
         position_col = np.random.random((n_col, 2))
         edge_labels = [(0, 1, 0), (1, 1, 1), (3, 10, 2)]
-        image = svg_bigraph(biadjacency=biadjacency, names_row=np.arange(n_row), names_col=np.arange(n_col),
-                            labels_row=np.arange(n_row), labels_col=np.arange(n_col), scores_row=np.arange(n_row),
-                            scores_col=np.arange(n_col), seeds_row=[0, 1], seeds_col=[1, 2],
-                            position_row=position_row, position_col=position_col, color_row='red', color_col='white',
-                            width=200, height=200, margin=10, margin_text=5, scale=3, node_size=5,
-                            node_size_min=1, node_size_max=30, node_weights_row=np.arange(n_row),
-                            node_weights_col=np.arange(n_col), display_node_weight=True, node_width=2, node_width_max=5,
-                            edge_labels=edge_labels, edge_width=2, edge_width_min=0.3, edge_width_max=4,
-                            edge_color='red', display_edge_weight=True, font_size=14)
+        image = visualize_bigraph(biadjacency=biadjacency, names_row=np.arange(n_row), names_col=np.arange(n_col),
+                                  labels_row=np.arange(n_row), labels_col=np.arange(n_col), scores_row=np.arange(n_row),
+                                  scores_col=np.arange(n_col), seeds_row=[0, 1], seeds_col=[1, 2],
+                                  position_row=position_row, position_col=position_col, color_row='red', color_col='white',
+                                  width=200, height=200, margin=10, margin_text=5, scale=3, node_size=5,
+                                  node_size_min=1, node_size_max=30, node_weights_row=np.arange(n_row),
+                                  node_weights_col=np.arange(n_col), display_node_weight=True, node_width=2, node_width_max=5,
+                                  edge_labels=edge_labels, edge_width=2, edge_width_min=0.3, edge_width_max=4,
+                                  edge_color='red', display_edge_weight=True, font_size=14)
         self.assertEqual(image[1:4], 'svg')
 
     def test_disconnect(self):
         adjacency = test_disconnected_graph()
         position = np.random.random((adjacency.shape[0], 2))
-        image = svg_graph(adjacency, position)
+        image = visualize_graph(adjacency, position)
         self.assertEqual(image[1:4], 'svg')
         biadjacency = test_bigraph_disconnect()
-        image = svg_bigraph(biadjacency)
+        image = visualize_bigraph(biadjacency)
         self.assertEqual(image[1:4], 'svg')
 
     def test_probs(self):
         adjacency = bow_tie()
         probs = np.array([[.5, .5], [0, 0], [1, 0], [0, 1], [0, 1]])
-        image = svg_graph(adjacency, probs=probs)
+        image = visualize_graph(adjacency, probs=probs)
         self.assertEqual(image[1:4], 'svg')
         probs = sparse.csr_matrix(probs)
-        image = svg_graph(adjacency, probs=probs)
+        image = visualize_graph(adjacency, probs=probs)
         self.assertEqual(image[1:4], 'svg')
         biadjacency = star_wars()
         probs_row = sparse.csr_matrix([[.5, .5], [0, 0], [1, 0], [0, 1]])
         probs_col = sparse.csr_matrix([[.5, .5], [0, 0], [1, 0]])
-        image = svg_bigraph(biadjacency, probs_row=probs_row, probs_col=probs_col)
+        image = visualize_bigraph(biadjacency, probs_row=probs_row, probs_col=probs_col)
         self.assertEqual(image[1:4], 'svg')
 
     def test_labels(self):
         adjacency = bow_tie()
         names = ["aa", "bb", "<>", "a&b", ""]
-        image = svg_graph(adjacency, names=names)
+        image = visualize_graph(adjacency, names=names)
         self.assertEqual(image[1:4], 'svg')
 
     def test_text(self):
@@ -160,11 +166,11 @@ class TestVisualization(unittest.TestCase):
         graph = karate_club(True)
         adjacency = graph.adjacency
         position = graph.position
-        _ = svg_graph(adjacency, position, filename=filename)
+        _ = visualize_graph(adjacency, position, filename=filename)
         with open(filename + '.svg', 'r') as f:
             row = f.readline()
             self.assertEqual(row[1:4], 'svg')
-        _ = svg_bigraph(adjacency, position, filename=filename)
+        _ = visualize_bigraph(adjacency, position, filename=filename)
         with open(filename + '.svg', 'r') as f:
             row = f.readline()
             self.assertEqual(row[1:4], 'svg')

scikit_network-0.31.0.dist-info/RECORD

@@ -1,221 +0,0 @@
-sknetwork/__init__.py,sha256=kBpEmTMrIJ3j_joqBDtQZvyALtCVOc41FnSvwUNMtCQ,554
-sknetwork/base.py,sha256=_63mkwqXFDke_0ve9DIZJiMHboMYqBONa7B08gao440,2018
-sknetwork/log.py,sha256=qDR-dnlzJC0ETlotPAy_IbLiQPgu8Vn90mgkqfvT5W0,462
-sknetwork/sknetwork.py,sha256=Qtq3EpSkdAFqQNQPDXTAouXS784LkR8Rh2D5s5w5_tc,47
-sknetwork/test_base.py,sha256=hdbe2ldftbPp6Y0-bAWehKy9cyyd3Adj9UX6NgYq0QQ,947
-sknetwork/test_log.py,sha256=ucX3w138eDyD0Wnpk9QEsPoQgAPTJNPy9twzMf5TjQ8,334
-sknetwork/classification/__init__.py,sha256=QoS3fTnCZ0nFdlDkEphEYqj1NDEf23_aqsfP0G4zLMM,483
-sknetwork/classification/base.py,sha256=JyRplfH2EdmXLMkE65HE-Oes8qpAyicZG8pL7_-vvnU,4424
-sknetwork/classification/base_rank.py,sha256=pAEbkFJWg_6iJTe37PPTQf0FTlzb4NyYhFC-DG-gTPg,4660
-sknetwork/classification/diffusion.py,sha256=gHa07SeI07LIRBhhUY1EZPJaAUb-8To5b699bp3_BWI,5146
-sknetwork/classification/knn.py,sha256=-a0Uny_yyGoc4JZ-dPqzouoCMCWQLzEkqcSceuEgnok,5128
-sknetwork/classification/metrics.py,sha256=1sPqOqliIexvL6ozNy9QTDKfHLV9Sqz5rGoSr3Gjv0M,7012
-sknetwork/classification/pagerank.py,sha256=1B5V-l7pYa4Bvl4o58VByYqxanDA6qKGJ71IS_EXMnI,2485
-sknetwork/classification/propagation.py,sha256=eHEG4plzQwxIXvp7mEMJVv23uhUn35iEWTVKjELtsWI,5614
-sknetwork/classification/vote.cp310-win_amd64.pyd,sha256=hA1WHQgi0nPO4Hg7IHwEaVUOSXQti21PtIW_Mbt7O_M,126464
-sknetwork/classification/vote.cpp,sha256=nX38hIU5dURwY9okIosSpp36JCN7SVD9f9YabRrjBEY,794586
-sknetwork/classification/vote.pyx,sha256=-mNsL96aaA1UL-qfeUgZlbdvKZUK9R4MLmq0BNFWVKA,1640
-sknetwork/classification/tests/__init__.py,sha256=Per0oy1Frnm5jB7dnpod1g_xbgYhqkNteWQV5cemcH0,32
-sknetwork/classification/tests/test_API.py,sha256=WV5cY8yhTHBHYRbDE3InZ4v-agymxLPMKxa2NqjbWZo,1154
-sknetwork/classification/tests/test_diffusion.py,sha256=lokZLSmvAw0unEWQ6IDPz5DjyEo2uWbmCbX18uzUxK0,2816
-sknetwork/classification/tests/test_knn.py,sha256=EWuWiJJSsfthfvb3x0ejUjdccRBZIFpmG6nv7F8VkOk,807
-sknetwork/classification/tests/test_metrics.py,sha256=9eqBvRiMdVUHf7WhjfwzMcUJFALt4Ufmx5LhBzou8Ww,2356
-sknetwork/classification/tests/test_pagerank.py,sha256=8ywBVzfJOtz_gTIn7XYr0nvHlVwvmZERLrG3LkQHeTU,640
-sknetwork/classification/tests/test_propagation.py,sha256=GzhpCpg0ijLvXuWtABolq02k0-Yh3UHJ2rAKpdQlTxI,874
-sknetwork/clustering/__init__.py,sha256=HAWSDCezfp1FkAQPIxOinB84G_L4cOlrjwnLyqPUths,343
-sknetwork/clustering/base.py,sha256=_4VBTkhqk11UuL_TCrdUARJ5Q4RTRQvaQ36sB-RF61s,6107
-sknetwork/clustering/louvain.py,sha256=9OJX0KcjVyO-BtNTIRCQJZejriS2dsMzAPoYk6YHYE0,9961
-sknetwork/clustering/louvain_core.cp310-win_amd64.pyd,sha256=g_zEYAs70vmBQp1bQgshyK-4WJWYZlwUitsR9B4M5aM,162304
-sknetwork/clustering/louvain_core.cpp,sha256=BJ09lz5YcgfzH1k5DUqk5mtQ9eDGU_DY3tRkXub5m4E,955083
-sknetwork/clustering/louvain_core.pyx,sha256=SQMoZxV2t7CRKShc16aC0Ry-_ZSMl-Gm-91B1fvbrjY,4617
-sknetwork/clustering/metrics.py,sha256=ptLLtUpFtdKLZ4lcx_MN-PpOrzv--PWhAcEFoFghccM,3151
-sknetwork/clustering/postprocess.py,sha256=Xk9FOPPBLemoROd--qgd9gc4I6xgMOXPKG-LSXqfEZQ,2101
-sknetwork/clustering/propagation_clustering.py,sha256=HMTZB_kuwoSOrPgzSTJ-sC0y9PRcm6TLQwE5O5nX8Dc,3840
-sknetwork/clustering/tests/__init__.py,sha256=tCA27jkL3pdstka9XWQEA1NbC6ZqL7Rf-1V1UcySCEE,28
-sknetwork/clustering/tests/test_API.py,sha256=0bDJZkcLQc8HkASnEgV89-OJ2-W02etjqUHPzflRH8I,1518
-sknetwork/clustering/tests/test_louvain.py,sha256=nkYC0zHd0n5eUhZxbLpKZPP-J1gZyn2jtuFAWPgBmq0,4811
-sknetwork/clustering/tests/test_metrics.py,sha256=ZTr4T-d-g6kQJinei9VH6Teb_rOScmj5XLG168EI5LQ,1868
-sknetwork/clustering/tests/test_postprocess.py,sha256=41l4coS_1CHqGOCnnucqxU6UkXws89YVMjef162ZTEQ,1417
-sknetwork/data/__init__.py,sha256=QScOMfOfm2j7rPaNLPGNc9TwHQGebWRZCBHHbmZarO8,265
-sknetwork/data/base.py,sha256=O_EN3j1hoSbHc96qxx-dAe5SsLGdLE1cqiX9fl0xjAw,658
-sknetwork/data/load.py,sha256=XJ6vcSh09O1hNI82k40nRJJF674npeG9DHk5wjzvsJE,14931
-sknetwork/data/models.py,sha256=luDuvYYcruOEw94iXNEnl5IbYJCVGtxB6jhDWVBmJH0,13615
-sknetwork/data/parse.py,sha256=-EgABauVkJ2EJS0NOp7_H5wNdqw6WPfZYAHs-6Fhtfg,26329
-sknetwork/data/test_graphs.py,sha256=KRRok5ElYWh1NV3i_2enLLjdeKe8zBg_3xqFXgOOY6I,2568
-sknetwork/data/timeout.py,sha256=mXSqgKFRc6AVZBlIobN2xPYJjAyQOClKH3KQJ5M_4Sw,1085
-sknetwork/data/toy_graphs.py,sha256=xdgNQjzwswpkCVioUR0_EzoQiS6QbuOAD0mgTs3Fphg,25654
-sknetwork/data/tests/__init__.py,sha256=LtUcKFe5CeBpspRwa6A2uX2cVEf_uPpOo2mGkH7W8cI,20
-sknetwork/data/tests/test_API.py,sha256=aytP2cJV9px-d-SogJn4SYPnTFJ1Xt2coEW7-EiljjM,987
-sknetwork/data/tests/test_base.py,sha256=h1-1fEyWuVpAOnZDFmkSuhngrQdv3N2vEMa_Wpt8dVU,322
-sknetwork/data/tests/test_load.py,sha256=wuLVlJ-lquoIrsr0UBI-gakW7BjGBZaSyEPavxX0NVY,3645
-sknetwork/data/tests/test_models.py,sha256=_2y5xZrWbE3XZltd4n-z84YwyJhPcpaBa2TxXMvhXF4,1967
-sknetwork/data/tests/test_parse.py,sha256=jJtOu9oQ920a8hzce_p0PPfBmjWtt6yfxPH-Azs0SV0,13006
-sknetwork/data/tests/test_test_graphs.py,sha256=3QWshIikkBtRl3C7ATc_zO5UkwOh1wZwD7gYm0CEj8o,878
-sknetwork/data/tests/test_toy_graphs.py,sha256=wQ2X-CVv9oycBUAaB68aJqg-0o3yMlaVtZ9D4thZJrc,2205
-sknetwork/embedding/__init__.py,sha256=XvDQcRkxf5Kbf51Ai6X74AgSAXMarFgP8_AGxeIZY7Q,479
-sknetwork/embedding/base.py,sha256=cupvrObiI19invfNBrfQtUqtMgYyKMb_gCUF-c3da_k,2851
-sknetwork/embedding/force_atlas.py,sha256=D1UOepcBnAXGleC-kCxIIRY1o5kPj-jLRUWw15IagR4,7626
-sknetwork/embedding/louvain_embedding.py,sha256=eU6THTLBqTokRwhj7q7lztXpXjla5LazGbgAHagleP8,7127
-sknetwork/embedding/louvain_hierarchy.py,sha256=PYfBgOyN6Bi61PNlbQIW6dD-6-fz5m7v2UMvy5lYKpo,5850
-sknetwork/embedding/random_projection.py,sha256=enjMO6sltf4zBLmavqS17X0iknrir5GkDWe8Rfgx7gQ,5053
-sknetwork/embedding/spectral.py,sha256=wZspZ9MvjwK9G-b3ys7gr8fD4goeWigYwd7mXMDcTUM,8335
-sknetwork/embedding/spring.py,sha256=Cl1airI_mSWmV1isKmcxqjY1uxw7NcH7xMwHc8ADmHA,7349
-sknetwork/embedding/svd.py,sha256=isI2y9GfCGA5VJmogHrtq2MDVaxuWCZsEvh4YqgfB2k,15097
-sknetwork/embedding/tests/__init__.py,sha256=PsZQYFNrSmRW_KIuNX3qVtxtZVn8yV18d0mk8Y6ieck,27
-sknetwork/embedding/tests/test_API.py,sha256=CVIg2qkAOCjz2dgGdT8gCImXiICRGX0KZGrKC-9LQTU,2652
-sknetwork/embedding/tests/test_force_atlas.py,sha256=dYiyWroqB7UKNW9MTYpGP6e7tF_qPWqVZNmZBndd_ks,1155
-sknetwork/embedding/tests/test_louvain_embedding.py,sha256=bsjMQy4nTmBLtrpalzr-8sKXOksZ5HvInRtYLrNSD9k,1189
-sknetwork/embedding/tests/test_louvain_hierarchy.py,sha256=QgOQRz0dkw-CesDk78wWKOD-bbR_tqHEBvitfn7POIY,753
-sknetwork/embedding/tests/test_random_projection.py,sha256=zz6q0G-pG-G2gOefhr-yuPBQhNDNtXB8jz7_dld1ZpE,1221
-sknetwork/embedding/tests/test_spectral.py,sha256=B7QR01IhxAbS-j4nFxY5TxReiP425u6B77-WXLShLy4,4348
-sknetwork/embedding/tests/test_spring.py,sha256=z3eT-mFcfNSoMWPKQF-Dz_ZjAsJplQrx1yspiaeFRBw,1693
-sknetwork/embedding/tests/test_svd.py,sha256=jn8Osv7eMzWHfdtFkuCB189cdJ0v2Af4Bm9bQ7QjzmQ,1212
-sknetwork/gnn/__init__.py,sha256=808PNZEYNHZrIBpKqPzAMKES8yhN6QXEVUWkZVJIJWI,529
-sknetwork/gnn/activation.py,sha256=rhvEXgrIix4nZ9I3WYZ0e1MID_DESCCC_XlVcOa4Wpo,3677
-sknetwork/gnn/base.py,sha256=qHnKsfsUW4LIdwm3vzfAahBjweCkIDRzk62i4piNBuc,5889
-sknetwork/gnn/base_activation.py,sha256=Kxs_d4aPOpMRXZMBAW7WKkA_uWLXRM7XM-JqE4nFHhc,2395
-sknetwork/gnn/base_layer.py,sha256=mGiMee2HKAdqlBcKLvr6ylRG-BrraBg68cGe4n6S-Q0,4085
-sknetwork/gnn/gnn_classifier.py,sha256=wgP03SVNOXrPiBnKw061iLY3RFkZrp9UeDWYwk7cMXc,14746
-sknetwork/gnn/layer.py,sha256=agAIKeoWcae4-QBeztGDCmowq68U_Cv3m2-4jZWBE04,5684
-sknetwork/gnn/loss.py,sha256=2cSOj-MbXjmrZbH-KQdEG6IYvSjdwMCnN7SUnI_fd7U,5342
-sknetwork/gnn/neighbor_sampler.py,sha256=l5OkylbRQsDpmkfeHAaSA7gHi5l7OUKtL4YvH-YTMWM,1929
-sknetwork/gnn/optimizer.py,sha256=DNL4AXAkO5bUhyK34MFBlZ7QaydYNtgjbhjJ_kjUsN4,5902
-sknetwork/gnn/utils.py,sha256=OZQuxNO2CAe_KVuXNCFyOzYA1HqwpJFWWpuuhlSesaU,4448
-sknetwork/gnn/tests/__init__.py,sha256=_q1IzwMWdNgX90qzdbVkr0LV4NTjFzXg81z4-TM93cw,21
-sknetwork/gnn/tests/test_activation.py,sha256=UznwTCvOeCX80n5urtoDhnM8lskDM67AsVFiY-ViqzU,2543
-sknetwork/gnn/tests/test_base.py,sha256=EN3QjzsSwzpOgyIYHwA6mgCDRBigx7YQ5iSQXQbw_pM,3468
-sknetwork/gnn/tests/test_base_layer.py,sha256=J1cVNOXOe1_iwaKqq6EAFBa_KG-fVthDDEETNWJaNqw,1432
-sknetwork/gnn/tests/test_gnn_classifier.py,sha256=xw7CKwTEltLBA5hI2ZVZmdbeGato4btLH4ia_tG_bbA,7120
-sknetwork/gnn/tests/test_layers.py,sha256=6Rbz_jJm3m5e6XWZA3P8Bfzlss9nBoiE4rSz2Tc-QKo,3256
-sknetwork/gnn/tests/test_loss.py,sha256=QvzXKW_xzirXUSkiDm9HgqJPHJdd55FOpuHWZzxyeKs,1078
-sknetwork/gnn/tests/test_neigh_sampler.py,sha256=7yhKZSRg2sZd3kFNs-qdj1LKgM7X8xZBNoOYYkYRfek,721
-sknetwork/gnn/tests/test_optimizer.py,sha256=OZnIeO__kNt8HXLHr-WHGzvDsTy4LvJ19p9jcFVzXME,1823
-sknetwork/gnn/tests/test_utils.py,sha256=MJvOXEWouRiIVaPM76W0hizt3jFb-1_BXHLd1zkPzSg,1884
-sknetwork/hierarchy/__init__.py,sha256=-2-y7iBVQRanXLSl9kY8VASJVqx37trYmVNcz74QsUc,418
-sknetwork/hierarchy/base.py,sha256=ugPo_VM6sPfZusqAAxcyaV02vP64SJbi91KjoxxozTs,2091
-sknetwork/hierarchy/louvain_hierarchy.py,sha256=QWgGQNoZxRoOBULDbC-1J-jRg7duDX8ItcL19WHpIlY,9367
-sknetwork/hierarchy/metrics.py,sha256=5WZLsSLYKifLIQ9aPrXyzvPtTFN5ROSlNivhV-n9VuY,8280
-sknetwork/hierarchy/paris.cp310-win_amd64.pyd,sha256=eH5WGnA6mPKomBgfMosz6QhAfE18jPaTtsMjJYhbDPs,189440
-sknetwork/hierarchy/paris.cpp,sha256=2GCmXkOtFkRhcst8hZfZlTK8CywVZoJhjSfR2QaAhvs,1191817
-sknetwork/hierarchy/paris.pyx,sha256=YVB5H1AtBDvWgX5kywaSaxnYgiQhSzu-9_3Yqj7aCAs,11915
-sknetwork/hierarchy/postprocess.py,sha256=h8v3Ft0li53ewkbpdeiM4j2Xw8tjPbvpJkpqIJstZ-Y,12313
-sknetwork/hierarchy/tests/__init__.py,sha256=jRlC4pbyKuxaiXvByYK-4ix7DwYWxpjwKNvSXZ7rQJE,27
-sknetwork/hierarchy/tests/test_API.py,sha256=f0QtuCDA5dRwhPogtwbjsVlDRTpk84ewkXgc6rHCSWU,744
-sknetwork/hierarchy/tests/test_algos.py,sha256=DtIlYH9zqX0tiX0nmuvL5jTAZiqMhb56F7IQRV-jeMc,1172
-sknetwork/hierarchy/tests/test_metrics.py,sha256=rcdFVeWf50bYnem55gmUaDfE6AmJuW8RtYEQcigqZ60,3222
-sknetwork/hierarchy/tests/test_postprocess.py,sha256=Bm1_XU6OgwZr_1B28IA5m_HZRqI7GMwlTLpzkXux__Y,2266
-sknetwork/linalg/__init__.py,sha256=_qdALdabKv3x8CAuhq6UB4R9jRewNfpgh6XCRnhHvCE,545
-sknetwork/linalg/basics.py,sha256=WDlylrkBTCQpjXGtzs8kshJYfpo0h3uM8TMhHmnAnnM,1179
-sknetwork/linalg/diteration.cp310-win_amd64.pyd,sha256=biKSHJ12CS4QfWO7NUID1jE5MZ1TZT5wV1lqJcgr8dM,116736
-sknetwork/linalg/diteration.cpp,sha256=UaIFr5VOvl1YCYE2YtH0EhbfSvMSmuVeHSvRf3cB_JE,791453
-sknetwork/linalg/diteration.pyx,sha256=1r7a1usqftiBNTPOAwHFQPK__nZ67J-87wQLM25GqEU,1431
-sknetwork/linalg/eig_solver.py,sha256=lMqxTg66_T-LsgGqc9oo_ngxpTceekavnCFOANWEpPA,2793
-sknetwork/linalg/laplacian.py,sha256=qifd-8iltcTKCQW-7fG5z3XfwVrrrCeaBqbViBQCLf0,416
-sknetwork/linalg/normalization.py,sha256=-bmgWOLZtzfCd7U4NBJ2h5f6m2C6BbYvtRwAoptp_Eo,2423
-sknetwork/linalg/operators.py,sha256=PPGw20FDAXWj89_CD-lVVh9oA30-O29-XtN_yIygKcM,7660
-sknetwork/linalg/polynome.py,sha256=qnIhfpRk26JMinuNCrZO1EDj5ci65ZLxkKJyhO7HxpE,2201
-sknetwork/linalg/ppr_solver.py,sha256=Vr8H5f3R8qwvqlhmvlt8p2t09v83WCLyx9mlCvXVLe8,6706
-sknetwork/linalg/push.cp310-win_amd64.pyd,sha256=mNaytKtPt7atPP8oRrMNTvdx6tHcWfSphO-p_JWxDs0,132096
-sknetwork/linalg/push.cpp,sha256=5WuXwnkFat9lOUijko0fybc9Iee42DmTjjNsHzIk_lk,911049
-sknetwork/linalg/push.pyx,sha256=79ycseJ1jOznzc1_KSexTGy_0dlX1jQVnf_WI8Ufvgc,2429
-sknetwork/linalg/sparse_lowrank.py,sha256=-6-cNRs6tpiNqA8ah3mBKWap3Nh9GQHTFIarPjIiC7U,5170
-sknetwork/linalg/svd_solver.py,sha256=XxP4AyKQInBQN3imcbtahXseZ4YyKj4ZI2UAJK1mDs4,2772
-sknetwork/linalg/tests/__init__.py,sha256=i2cO6oXoryXdEJ-HdSFZsY7LZdNit7W3GC8J8LAUMU4,24
-sknetwork/linalg/tests/test_eig.py,sha256=c_BpjP_S7xCwYgk2N7kaFfsjV1-nfUYCu3Rys07bPeo,1548
-sknetwork/linalg/tests/test_laplacian.py,sha256=iGI4bFmYfhCbymlN4wcnE0tV9GmApC3g7bDL3Qx8dR0,452
-sknetwork/linalg/tests/test_normalization.py,sha256=mwUzdftJg0ZucOi5hf1X0dqOhfMJWyhjpIdymIYeEyc,1142
-sknetwork/linalg/tests/test_operators.py,sha256=0m5jWpCuK-gLfq6EdclDC69KxNViYM_2AfNiAPt7QMU,3179
-sknetwork/linalg/tests/test_polynome.py,sha256=-F0iMhYd1lVFau6ILxq7Mr5BtJxJPB-TX3ya3tQwzOM,1015
-sknetwork/linalg/tests/test_ppr.py,sha256=uN8vTEemFSDLJJYW2W9EVKb8x25ynB8Bez0D7q-B3NQ,2139
-sknetwork/linalg/tests/test_sparse_lowrank.py,sha256=Vqeey1W8jB85zT0L4c5TEGTL0hyQ9zX4FQ6EEI4tmHE,2337
-sknetwork/linalg/tests/test_svd.py,sha256=9Uu89-1vTlaJ_H82MUwzGz-iiYf_wFiZMyfelVBRHMI,1323
-sknetwork/linkpred/__init__.py,sha256=a7t20Q3xpm1M5IXnyErmucoQuHnGwPTNKAD42oYHEWQ,74
-sknetwork/linkpred/base.py,sha256=7eoKAAHSs5a31wRooV7MAHS6aDyeSz9sdDYbBo5JD7M,782
-sknetwork/linkpred/nn.py,sha256=I9r5xiob1lFAcNfF7369LOLzwZMJJrzFofJOvEL0Sws,4085
-sknetwork/linkpred/tests/__init__.py,sha256=vghxhmK0F5SJOYIb9HZV0h3AVXsCVEPwkgfM7aPpV9M,33
-sknetwork/linkpred/tests/test_nn.py,sha256=-1r8LyU34XXvhHnvJA53fGmOd6Ei2jGG6-LHtYvHYGc,1010
-sknetwork/path/__init__.py,sha256=FU7sn-HrqXGbJQzCIlQgE95LGDwwMRzBe-qp4rTt-3A,227
-sknetwork/path/dag.py,sha256=UAhn3uL2hlCybyOY0ZBnFh1aJnWwWpZ4pfhg-Ay2JKU,1722
-sknetwork/path/distances.py,sha256=f_XrITrz_EkTzNmclOomkGwH1abZ-PiwFlgFufrS0qA,3445
-sknetwork/path/search.py,sha256=SD6iV6m_OdygudaJ3vaNyLQtlGZrHjfCvA0BIFPPAN0,807
-sknetwork/path/shortest_path.py,sha256=jvijMKYg9p-u5__P7WHhzvkNyBwJSn_29GIeYpS2q-g,2509
-sknetwork/path/tests/__init__.py,sha256=ntNGJ8p6RZkIrYnePF-TESyoidEXx8fw6A9OBNAlIqo,29
-sknetwork/path/tests/test_dag.py,sha256=lualgStm0Boqx88j38tNuRKrW7Ala5ZfIHzlKdFbVRM,975
-sknetwork/path/tests/test_distances.py,sha256=yNkg6MiH3nfrFvEuL_DGMgiUkKa8SyhlqudOhwCoPR0,2327
-sknetwork/path/tests/test_search.py,sha256=JqauA2PRb-NbmMhlX80GEe2iNQAhSVdqu1G3eKDkri8,1243
-sknetwork/path/tests/test_shortest_path.py,sha256=zeM-qgbTs3i29gvF568otKOKgv_pbryV_yGefThLEIY,1422
-sknetwork/ranking/__init__.py,sha256=lbkUSZ3alkLK0xGiUx5ptPqhQKIjIKK80uPk0KymJPc,356
-sknetwork/ranking/base.py,sha256=7HxTw136hWuqOHPLgtpcboWZTxBx00tBYuJt-O9P7q8,1497
-sknetwork/ranking/betweenness.cp310-win_amd64.pyd,sha256=681Ro-R6GGaUmLI7Y7LC8ZKV7f7nlTNVl80Xo9-QXHY,65536
-sknetwork/ranking/betweenness.cpp,sha256=ap4WiJkEEFNIy5xFBp1AuE3ga7roheOp1hpzaPGG6I8,265626
-sknetwork/ranking/betweenness.pyx,sha256=fe5_gwRQ0TaFi_0-vUGfy6XC5kW5un5xly7-xVDgxrU,3184
-sknetwork/ranking/closeness.py,sha256=CvdAaqsM8HvAi6zGCuLcVF0BUu9n9UPBz_YxZhFF_sM,2932
-sknetwork/ranking/hits.py,sha256=uhGJH2C0U9hLsVRutI6M1ulbEIM7L6dCeYqiAhtTD9A,2855
-sknetwork/ranking/katz.py,sha256=WQpxJq_qqvjFm1ZG_P1ynfpzLlPu-dXCJ9luK-8sRjY,2618
-sknetwork/ranking/pagerank.py,sha256=-cgPvGfiITFSs5X6GJca2Pq4UATK3W8s6Vpr6potjD4,4789
-sknetwork/ranking/postprocess.py,sha256=F2yP6AsaK9ylTzukLCdtJET7_KnprrxkyWTSKQOnODk,956
-sknetwork/ranking/tests/__init__.py,sha256=46AJCs9irV6PtFg8CVH8TqpqHA6ajs29-3rsL3zxZQ8,25
-sknetwork/ranking/tests/test_API.py,sha256=ZyPjemb2imUDaJhDBl0IMnJAx0bRXA75kPm_rrM-AX8,1145
-sknetwork/ranking/tests/test_betweenness.py,sha256=m-mYofSfLvswGvcIPOjZcfWG9HbbjY9RI8x0Eb9zD90,1175
-sknetwork/ranking/tests/test_closeness.py,sha256=7LSiT-H5S1vuaOj4NHpotg0voIWjgJfVlgR96_V2ny8,853
-sknetwork/ranking/tests/test_hits.py,sha256=aOPsAyU3GNyb_Mcujd7U_TLBtzWn91SuOPyZZRUF9MU,511
-sknetwork/ranking/tests/test_pagerank.py,sha256=e_f7Y33ITMDZyFgvZaRxrTyIODgvXwKgDK8BgMyitw0,1983
-sknetwork/ranking/tests/test_postprocess.py,sha256=TpyU3_DKbnSwuf0HEuEYMiNbdI6Z5oP1JNO6kWigFkc,729
-sknetwork/regression/__init__.py,sha256=FYnlc-DKS1Mz2lKVCtKldjSgtvzxMmkd5kwKq2HdNmE,145
-sknetwork/regression/base.py,sha256=Dnvr3egl7pWpYVUjRITgsjOXsxjN76KtCd4nEy8wFuc,1123
-sknetwork/regression/diffusion.py,sha256=GagoWzmlc86w8eY_df-kIbbyNVNXzrhE1XJIkLFSTNU,7462
-sknetwork/regression/tests/__init__.py,sha256=GvqvsSMbqMYwRmWw4VrZntwccz1jOPqrqufAZqw_NAc,28
-sknetwork/regression/tests/test_API.py,sha256=7x_n8bG8hUcJVRYDbdC6GvPmwW5cE7HmASlu5SHnwFI,1056
-sknetwork/regression/tests/test_diffusion.py,sha256=kUncxGwUnXFn15TfAkQKqE4syVvg_-ERNZGwua1JJoo,1734
-sknetwork/topology/__init__.py,sha256=nf6yGfRNIFYL65UJNiGvZUqemGUJrwcj7k3Q-vF-7A4,361
-sknetwork/topology/cliques.cp310-win_amd64.pyd,sha256=wyvQO0V8L_GjtLZpcr90QYElVx75rEtoABz3eS_Hk24,144896
-sknetwork/topology/cliques.cpp,sha256=21DO6ucynhs4MMi0qOdo8e1cofL-dCeHZOnZMgCCGBI,951751
-sknetwork/topology/cliques.pyx,sha256=y6Ee5oaX7IdVhXXjSOazqT5dYo4gSTQ8Mq0u1Abg0vw,4659
-sknetwork/topology/core.cp310-win_amd64.pyd,sha256=CIJna37udMYNwNgk_nMourwJGGTZ3Q6oyX3QE2R3BOY,124928
-sknetwork/topology/core.cpp,sha256=WscYFFfdKJgYnqMWmOr2kQM4xWyN8IQCkAZ5G1iPIyY,882271
-sknetwork/topology/core.pyx,sha256=0PO4HnOYivjrFY1NMlXHd7wscu0R5Fg-Toj3YVRwXDo,2555
-sknetwork/topology/minheap.cp310-win_amd64.pyd,sha256=Ch_CHpBrql22Fp4oehjG0IXEDHb-wfx1EuhokBH0mbw,104448
-sknetwork/topology/minheap.cpp,sha256=IMIBpRCsecqlH0hgUjReKrCaTSQdufsGcSylmKtytLM,778758
-sknetwork/topology/minheap.pxd,sha256=AHeBNN8wGzT429K6AyhbrFUoBkWVwbkyUIY6TkeJ80g,584
-sknetwork/topology/minheap.pyx,sha256=KOmjjlljgkGUJNL8PQ6WaNzx-Ro84QoSve_8baDN1B0,3419
-sknetwork/topology/structure.py,sha256=BBMZ1OHKvPWYurYjQORfX98tBPtN43rZngbUQiWKnmI,8852
-sknetwork/topology/triangles.cp310-win_amd64.pyd,sha256=zBFeP31YrPlFitjrpDsXenV4F1cGkr7o6Kgx2qwoAPA,39424
-sknetwork/topology/triangles.cpp,sha256=he2Kpp53YjIjT4fsEIgtPw3NEtRO0lIBhDCaaO9bON0,201093
-sknetwork/topology/triangles.pyx,sha256=NAuWB4UG7WiC71xqW9W_oQlr4yB3QZA-qNTbjPL4IdQ,4291
-sknetwork/topology/weisfeiler_lehman.py,sha256=U5b5RoTFtqBeFwkuBXs4g0Px2UWRFePyneu-tfgnY_I,4441
-sknetwork/topology/weisfeiler_lehman_core.cp310-win_amd64.pyd,sha256=MeuBnSUXI7ErUDLGWzlHKkGdJDLMqQ5uUVl-CMA57YA,126464
-sknetwork/topology/weisfeiler_lehman_core.cpp,sha256=4jJggzELpdPJ7cxuDqM14rUxtwqYWCB1Litp1a4eHlo,798124
-sknetwork/topology/weisfeiler_lehman_core.pyx,sha256=lpUV1BpxtedsGBfOl19b8OFXCIbyaAA4ZYlW6BzSxbw,3148
-sknetwork/topology/tests/__init__.py,sha256=84T-xv8JCFeA9D7Rxw9gy3_dNAoE8CY1k1pYcuG8K3s,26
-sknetwork/topology/tests/test_cliques.py,sha256=vdRMDmF8AKkIWE-LnU2yGzk1wzwzq9PdggpeS-8wfRw,866
-sknetwork/topology/tests/test_core.py,sha256=7w9lrzsQ5Pn7QzxA0F_L58cXCABFir7rtLn2DZdPKsk,570
-sknetwork/topology/tests/test_structure.py,sha256=MJcPSCNSxairXVc_FO4nCsqJu7f_-zyy1VC4sFL8b90,4734
-sknetwork/topology/tests/test_triangles.py,sha256=5AYxNQ8DkKTvpShWEWV-v1r7WZx1DuylChcEmVF0yTk,1313
-sknetwork/topology/tests/test_wl.py,sha256=vesYcnlJHPphk2RJLzKJH9N6aYpPeKLFJko1E8kBdtc,2290
-sknetwork/utils/__init__.py,sha256=ceT5UU4JRxCqpDlPj84gPBaKMRsI6b_YfaBzkK67Qo4,336
-sknetwork/utils/check.py,sha256=LWUkHwDzr9Z9IyT7AIsrQyDrRAMjO2bzWyFsv_P9Ask,13295
-sknetwork/utils/format.py,sha256=5gKHLLBuGboIqmtNKiwzrC_qbh-sPi_mejhJ_8teaLs,8974
-sknetwork/utils/membership.py,sha256=claXsrZd6BVT4WuuI0P00tqapbczvAxtLAWMWNQ78KE,2234
-sknetwork/utils/neighbors.py,sha256=-EwBXigM3mn2qvVTi_aPmG0XifDMojZgsMQ9_A8cLkk,3466
-sknetwork/utils/tfidf.py,sha256=vvISEaZJa7RZrNNgQEAHgMH2rJToARuNWcVjnA8u7po,993
-sknetwork/utils/values.py,sha256=aUc2fuI56J78_6P-S2mT4NhHgiiIZp6D2feNKcsQmG4,2584
-sknetwork/utils/tests/__init__.py,sha256=JQuARG8Ycb5apL6PUy_wuEHsLjmEZFOPQUKWRgTMdCY,23
-sknetwork/utils/tests/test_check.py,sha256=LxYAubg6YZ0RHYFz_R3byNtw3EQ6hsHxPPI3QgP1DLg,6954
-sknetwork/utils/tests/test_format.py,sha256=NJrRBI-kFF8dYFmTwuFF7VUnHS6Mz75DG-RB-iGk8ag,2308
-sknetwork/utils/tests/test_membership.py,sha256=d_TobwpRl2K3qCcFBDQV1bGCSmF7Ls3r2s_XGvJC3Sg,772
-sknetwork/utils/tests/test_neighbors.py,sha256=Q7-Y23CcF4vn5lcyEqjaojEAk7-pG03Mf59O1Rz3IUs,1467
-sknetwork/utils/tests/test_tfidf.py,sha256=KYz_LSxi625kKL-v5-uA1-YQOliIfgXCmNXTAZtgpmw,463
-sknetwork/utils/tests/test_values.py,sha256=K3ctTXpSy9fwiHnpFVlHX5KeTd2wNF4kbFiTXe_gQq8,2334
-sknetwork/visualization/__init__.py,sha256=0gVE7r4oXW6IPlNzq2EXwvr_oRDwCjtuhBh0FN-4I4Y,162
-sknetwork/visualization/colors.py,sha256=NhyMQeetfH16khnJD2gD_uZJkBD3JQDV0K3Jzacamqw,2543
-sknetwork/visualization/dendrograms.py,sha256=-U-WVuO-uFpqPrXuWJmhpkIUyeYX-GLemRmChdtbWhY,8280
-sknetwork/visualization/graphs.py,sha256=vx2PC_IilHNW9G6GgNq3muFCM7Hc3Mz0lHMrOmH8Qu8,32806
-sknetwork/visualization/tests/__init__.py,sha256=hrso2pNVzMWn4D2pRyWA_xAMib-xacKjm-rf91MyGGk,31
-sknetwork/visualization/tests/test_dendrograms.py,sha256=4BEdDonrQZsylKgwDpxwTdUZTnqbMKokpugTYbcAp5o,2455
-sknetwork/visualization/tests/test_graphs.py,sha256=FkzWHYx0KHr0sxP7Go-KZICjoiGXK1EoF8nzIMUiFBc,8968
-scikit_network-0.31.0.dist-info/AUTHORS.rst,sha256=SSAG2WortFtGW_lEWFDX15zhkIvoEOwc60q2yVTRN7Q,921
-scikit_network-0.31.0.dist-info/LICENSE,sha256=BJ1Hth1QjBmjIfHcp1sVxlkEqHYM58Vn5bcpYcggMZE,1656
-scikit_network-0.31.0.dist-info/METADATA,sha256=wXSb_IbBBsuXwnQq37r8hav6vMIyz0PDv3mSRNSayRY,14521
-scikit_network-0.31.0.dist-info/WHEEL,sha256=rneS2j8QNmAwdNKHN86s6-qP7AMcWZgqiEoH3bdbh_Y,102
-scikit_network-0.31.0.dist-info/top_level.txt,sha256=fkwspWQ9B3csqb5ENEOoVciRY6XftnMuz4MvTDQeSsg,10
-scikit_network-0.31.0.dist-info/RECORD,,

sknetwork/embedding/louvain_hierarchy.py

@@ -1,142 +0,0 @@
-#!/usr/bin/env python3
-# coding: utf-8
-"""
-Created on Dec 2020
-@author: Quentin Lutz <qlutz@enst.fr>
-"""
-from typing import Optional, Union
-
-import numpy as np
-from scipy import sparse
-
-from sknetwork.utils.check import check_format, check_random_state
-from sknetwork.utils.format import get_adjacency
-from sknetwork.clustering.louvain import Louvain
-from sknetwork.embedding.base import BaseEmbedding
-
-
-class LouvainNE(BaseEmbedding):
-    """Embedding of graphs based on the hierarchical Louvain algorithm with random scattering per level.
-
-    Parameters
-    ----------
-    n_components : int
-        Dimension of the embedding.
-    scale : float
-        Dilution factor to be applied on the random vector to be added at each iteration of the clustering method.
-    resolution :
-        Resolution parameter.
-    tol_optimization :
-        Minimum increase in the objective function to enter a new optimization pass.
-    tol_aggregation :
-        Minimum increase in the objective function to enter a new aggregation pass.
-    n_aggregations :
-        Maximum number of aggregations.
-        A negative value is interpreted as no limit.
-    shuffle_nodes :
-        Enables node shuffling before optimization.
-    random_state :
-        Random number generator or random seed. If None, numpy.random is used.
-
-    Attributes
-    ----------
-    embedding_ : array, shape = (n, n_components)
-        Embedding of the nodes.
-    embedding_row_ : array, shape = (n_row, n_components)
-        Embedding of the rows, for bipartite graphs.
-    embedding_col_ : array, shape = (n_col, n_components)
-        Embedding of the columns, for bipartite graphs.
-    Example
-    -------
-    >>> from sknetwork.embedding import LouvainNE
-    >>> from sknetwork.data import karate_club
-    >>> louvain = LouvainNE(n_components=3)
-    >>> adjacency = karate_club()
-    >>> embedding = louvain.fit_transform(adjacency)
-    >>> embedding.shape
-    (34, 3)
-
-    References
-    ----------
-    Bhowmick, A. K., Meneni, K., Danisch, M., Guillaume, J. L., & Mitra, B. (2020, January).
-    `LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding.
-    <https://hal.archives-ouvertes.fr/hal-02999888/document>`_
-    In Proceedings of the 13th International Conference on Web Search and Data Mining (pp. 43-51).
-    """
-    def __init__(self, n_components: int = 2, scale: float = .1, resolution: float = 1, tol_optimization: float = 1e-3,
-                 tol_aggregation: float = 1e-3, n_aggregations: int = -1, shuffle_nodes: bool = False,
-                 random_state: Optional[Union[np.random.RandomState, int]] = None, verbose: bool = False):
-        super(LouvainNE, self).__init__()
-
-        self.n_components = n_components
-        self.scale = scale
-        self._clustering_method = Louvain(resolution=resolution, tol_optimization=tol_optimization,
-                                          tol_aggregation=tol_aggregation, n_aggregations=n_aggregations,
-                                          shuffle_nodes=shuffle_nodes, random_state=random_state, verbose=verbose)
-        self.random_state = check_random_state(random_state)
-        self.bipartite = None
-
-    def _recursive_louvain(self, adjacency: Union[sparse.csr_matrix, np.ndarray], depth: int,
-                           nodes: Optional[np.ndarray] = None):
-        """Recursive function for fit, modifies the embedding in place.
-
-        Parameters
-        ----------
-        adjacency :
-            Adjacency matrix of the graph.
-        depth :
-            Depth of the recursion.
-        nodes :
-            The indices of the current nodes in the original graph.
-        """
-        n = adjacency.shape[0]
-        if nodes is None:
-            nodes = np.arange(n)
-
-        if adjacency.nnz:
-            labels = self._clustering_method.fit_transform(adjacency)
-        else:
-            labels = np.zeros(n)
-
-        clusters = np.unique(labels)
-
-        if len(clusters) != 1:
-            random_vectors = (self.scale ** depth) * self.random_state.rand(self.n_components, len(clusters))
-            for index, cluster in enumerate(clusters):
-                mask = (labels == cluster)
-                nodes_cluster = nodes[mask]
-                self.embedding_[nodes_cluster, :] += random_vectors[:, index]
-                n_row = len(mask)
-                indptr = np.zeros(n_row + 1, dtype=int)
-                indptr[1:] = np.cumsum(mask)
-                n_col = indptr[-1]
-                combiner = sparse.csr_matrix((np.ones(n_col), np.arange(n_col, dtype=int), indptr),
-                                             shape=(n_row, n_col))
-                adjacency_cluster = adjacency[mask, :].dot(combiner)
-                self._recursive_louvain(adjacency_cluster, depth + 1, nodes_cluster)
-
-    def fit(self, input_matrix: Union[sparse.csr_matrix, np.ndarray], force_bipartite: bool = False):
-        """Embedding of graphs from a clustering obtained with Louvain.
-
-        Parameters
-        ----------
-        input_matrix :
-            Adjacency matrix or biadjacency matrix of the graph.
-        force_bipartite :
-            If ``True``, force the input matrix to be considered as a biadjacency matrix even if square.
-        Returns
-        -------
-        self: :class:`LouvainNE`
-        """
-        # input
-        input_matrix = check_format(input_matrix)
-        adjacency, self.bipartite = get_adjacency(input_matrix, force_bipartite=force_bipartite)
-        n = adjacency.shape[0]
-
-        # embedding
-        self.embedding_ = np.zeros((n, self.n_components))
-        self._recursive_louvain(adjacency, 0)
-
-        if self.bipartite:
-            self._split_vars(input_matrix.shape)
-        return self

sknetwork/embedding/tests/test_louvain_hierarchy.py

@@ -1,19 +0,0 @@
-#!/usr/bin/env python3
-# -*- coding: utf-8 -*-
-"""tests for LouvainNE"""
-import unittest
-
-from sknetwork.data.test_graphs import test_graph, test_disconnected_graph, test_digraph, test_bigraph
-from sknetwork.embedding import LouvainNE
-
-
-class TestLouvainNE(unittest.TestCase):
-
-    def test_louvain_hierarchy(self):
-        louvain = LouvainNE()
-        for adjacency in [test_graph(), test_disconnected_graph(), test_digraph()]:
-            self.assertTupleEqual(louvain.fit_transform(adjacency).shape, (10, 2))
-        louvain.fit(test_bigraph())
-        self.assertTupleEqual(louvain.embedding_.shape, (6, 2))
-        louvain.fit(test_graph(), force_bipartite=True)
-        self.assertTupleEqual(louvain.embedding_.shape, (10, 2))