scikit-network 0.30.0__cp310-cp310-win_amd64.whl → 0.32.1__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
@@ -8,9 +8,9 @@ import unittest
 import numpy as np
 from scipy import sparse
 
-from sknetwork.data.test_graphs import test_graph_disconnect, test_bigraph_disconnect
+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,51 +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_graph_disconnect()
+        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_membership(self):
+    def test_probs(self):
         adjacency = bow_tie()
-        membership = sparse.csr_matrix([[.5, .5], [0, 0], [1, 0], [0, 1], [0, 1]])
-        image = svg_graph(adjacency, membership=membership)
+        probs = np.array([[.5, .5], [0, 0], [1, 0], [0, 1], [0, 1]])
+        image = visualize_graph(adjacency, probs=probs)
+        self.assertEqual(image[1:4], 'svg')
+        probs = sparse.csr_matrix(probs)
+        image = visualize_graph(adjacency, probs=probs)
         self.assertEqual(image[1:4], 'svg')
         biadjacency = star_wars()
-        membership_row = sparse.csr_matrix([[.5, .5], [0, 0], [1, 0], [0, 1]])
-        membership_col = sparse.csr_matrix([[.5, .5], [0, 0], [1, 0]])
-        image = svg_bigraph(biadjacency, membership_row=membership_row, membership_col=membership_col)
+        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 = 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):
@@ -157,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.30.0.dist-info/RECORD

@@ -1,227 +0,0 @@
-sknetwork/__init__.py,sha256=jkpo7YNbBq4jJuolUFmoKkwtSNcvADLSxFHU5uAeOBA,554
-sknetwork/sknetwork.py,sha256=Qtq3EpSkdAFqQNQPDXTAouXS784LkR8Rh2D5s5w5_tc,47
-sknetwork/classification/__init__.py,sha256=QoS3fTnCZ0nFdlDkEphEYqj1NDEf23_aqsfP0G4zLMM,483
-sknetwork/classification/base.py,sha256=XUt7XY_molL68DGtrT1Qovg0Qzz-yCe4u3kHtnvABAM,4517
-sknetwork/classification/base_rank.py,sha256=xwVnujfiyioU76U5UUVHETvMzVPaOY417nW44UShazw,5001
-sknetwork/classification/diffusion.py,sha256=ZBgD5_3_ZbCJvjF-v88E4uXakswynb3b95zZ0xigrCM,5531
-sknetwork/classification/knn.py,sha256=l9GZDxLe33Og2o3KH6W06HFo4OZasPkxBmzTA7vQU4o,5280
-sknetwork/classification/metrics.py,sha256=1sPqOqliIexvL6ozNy9QTDKfHLV9Sqz5rGoSr3Gjv0M,7012
-sknetwork/classification/pagerank.py,sha256=QtKsuaob8-l4PavvttLhtdGFW_yahM6MjEFmwlHE7Rk,2612
-sknetwork/classification/propagation.py,sha256=odXNOrFUTH3o-2bYBvqjljngAb-x7Qt-QuCWZuC_jMQ,5760
-sknetwork/classification/vote.cp310-win_amd64.pyd,sha256=TjbxZd4OZ6_xNCs2TIZloIiaHGJNCOJfmZrpoDd4UUo,205824
-sknetwork/classification/vote.cpp,sha256=zqsEckc9EhqXA1DaDKuqBBlXsd1eh9RWn8X6ELDlHRw,876336
-sknetwork/classification/vote.pyx,sha256=9II49U_j2UQyBEsDzvnRmescsCrwFjlMOiSuMiJWQME,1716
-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=9BC5qYbm7DQUmZCNfatrEFcAJOoQCv5MhAUGO7zGCKc,2798
-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=mk9fws0XTf-SvckRZd0LzA4eIRtQhIFoVpb4b3y9sPM,6472
-sknetwork/clustering/louvain.py,sha256=X9dwCKFgIGUt9G3W5bFKWYyyi9dSU5YO53R_LiE0aEw,10117
-sknetwork/clustering/louvain_core.cp310-win_amd64.pyd,sha256=SWLijZLDHEl9SH94hP2kgjRPL1aCkyxYnLl1BVL99R0,248320
-sknetwork/clustering/louvain_core.cpp,sha256=DMLu0ff4Fe_L9yxd-FSbEUXp5nw7_aNTPIOnDINPUmc,1043679
-sknetwork/clustering/louvain_core.pyx,sha256=Ah5pVcqvO_ULRB13H4hTBUUJxCeKo0_zIHViUGr8Pvs,4692
-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=WLDf9rurCaV1Ue14MQD6JI6JLORpKHBNptOgh0ncQRA,3955
-sknetwork/clustering/tests/__init__.py,sha256=tCA27jkL3pdstka9XWQEA1NbC6ZqL7Rf-1V1UcySCEE,28
-sknetwork/clustering/tests/test_API.py,sha256=WAXGGx_LIRQirOZAA95KM3JHuCE-vocm6rGc4JUIg5c,1516
-sknetwork/clustering/tests/test_louvain.py,sha256=KPrB3C_kQwz2Rn3djKEwWfu7hJ246GrcTNYcd83xTEY,4809
-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=Cf-TeZkkmgeOcAQ4-vEZRqBJ55ANjdMMiiHY2dZk15s,310
-sknetwork/data/load.py,sha256=-0qleEIdmauQV3e4f86Q6euq1b_Tvkjs1p9xl1-U-8g,14870
-sknetwork/data/models.py,sha256=K8y142q4cOe1DXO_ZvFfoAO-0l_dXnqvBqhceprVSY8,13581
-sknetwork/data/parse.py,sha256=0PHPoVqM-s6PnymttjjnO8kmULPjQcqvHWMzaZPmH8c,26287
-sknetwork/data/test_graphs.py,sha256=N1kwEDOQX9BRA7A47NocBEvdejPjUnDYucaUtQqx9mw,2572
-sknetwork/data/toy_graphs.py,sha256=Bgb0bqDVqlU8ry0ZmqILRPuYNy_leT6M0QBvnEqdYDI,25616
-sknetwork/data/tests/__init__.py,sha256=LtUcKFe5CeBpspRwa6A2uX2cVEf_uPpOo2mGkH7W8cI,20
-sknetwork/data/tests/test_API.py,sha256=qR2Af9Nqgkj4VSNQ2jgxGV7vzMr9fA1qqXk1J-Ys3XA,988
-sknetwork/data/tests/test_load.py,sha256=uoZQna3lXxqP9ScWhI_LWc5q6wVIfREJROe9F-CwmB8,3646
-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=2Iqfyr-zzptjzG8KROzdGR7O_zuC77n5EM0EWXwEBwo,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=peUIlGj0NdLSSgS_ReXMRh1d7UeHWbSG1-w1O7IH-_k,2857
-sknetwork/embedding/force_atlas.py,sha256=D1UOepcBnAXGleC-kCxIIRY1o5kPj-jLRUWw15IagR4,7626
-sknetwork/embedding/louvain_embedding.py,sha256=H300QiFP_jqWcHWLhJHZSbA46RmKUk44Qu-B_CJ9FKo,7132
-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=shQCsB8qfpP_5LCOKdAtOnDcs78e3Ag9IB_-0Umezws,749
-sknetwork/embedding/tests/test_random_projection.py,sha256=CWrqoT3-CZTF25oJPlYyfzlbP4iICMWWExOockM1btI,1217
-sknetwork/embedding/tests/test_spectral.py,sha256=cjOy0HNb2P3Q8b1wXQ2YNNBILSvhGUqEVWYTwhatFYU,4342
-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=7XznRlzuPJcpOjYT9lRzdD7KuvDL0y-iELEp2xmI60w,5932
-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=zdnv9rlWy9VdmyKYN7NdoTTuuX5xha0u0arZ7FkPUcE,14598
-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=RrmQumX9_3RA7y-H3CgWi4AIR-XYNC9ZWHb_D6WySm4,7012
-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=iXQvMTGGGbLm5zOgHNpR8erMtJIXNDqV8X5oNY80wNg,2097
-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=3wXllpcii0YLKoUcmKiptwh_LnT-sEf38qOTSRGnCgg,284672
-sknetwork/hierarchy/paris.cpp,sha256=daV8ZWQLfviO6tiNxto2BmMDap3TqXbnQAmsjieEy3Y,1296401
-sknetwork/hierarchy/paris.pyx,sha256=q6hjnaLmFBL_T6RK2Id4TgqN89V4DyJhFzvkl9H-pdo,11990
-sknetwork/hierarchy/postprocess.py,sha256=h8v3Ft0li53ewkbpdeiM4j2Xw8tjPbvpJkpqIJstZ-Y,12313
-sknetwork/hierarchy/tests/__init__.py,sha256=jRlC4pbyKuxaiXvByYK-4ix7DwYWxpjwKNvSXZ7rQJE,27
-sknetwork/hierarchy/tests/test_API.py,sha256=TuAH54nypEPmhzV9POoyg43cVLop7FQhhhl_w-NgwjA,742
-sknetwork/hierarchy/tests/test_algos.py,sha256=DtIlYH9zqX0tiX0nmuvL5jTAZiqMhb56F7IQRV-jeMc,1172
-sknetwork/hierarchy/tests/test_metrics.py,sha256=FOo-AhxIf_3U9LGuE3OFA1ZbycbqMa8KH0iarSIwH6Y,3220
-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=lpeAZJUOCBMXpyEIWUC6y0TcUx2x7CYHF_qx6yX-R3M,195584
-sknetwork/linalg/diteration.cpp,sha256=oYB83Aml6u4QiczRYjbkD0hotaydBJvNmNPTaDOZbUg,878950
-sknetwork/linalg/diteration.pyx,sha256=kYl5ZxCBzaK7F3Ju40pcjzph5qaPX95UKfUecsmjh9k,1506
-sknetwork/linalg/eig_solver.py,sha256=-Xl87UQUFD9Y7UJok2SYD3Vv0Z82FZ-quqsdOqjEOgY,2799
-sknetwork/linalg/laplacian.py,sha256=qifd-8iltcTKCQW-7fG5z3XfwVrrrCeaBqbViBQCLf0,416
-sknetwork/linalg/normalization.py,sha256=obwwS0E_gVXbZlVkxWBVmAyGlTS8WCKwSTnK7wayJTw,2393
-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=7Cwpq41cmFrEjz9UvlMWAZ6zeoMAHGWClvSEqnNR6Z8,214528
-sknetwork/linalg/push.cpp,sha256=G1XPYrRt5YtuvFWFhSriHHWxtXsxaCxBoQWGgbMoSkk,1005496
-sknetwork/linalg/push.pyx,sha256=jPjTqyhhXSKfqsYhbwkPGP_y6wJt_dfmof4FZS0Pvp0,2504
-sknetwork/linalg/sparse_lowrank.py,sha256=-6-cNRs6tpiNqA8ah3mBKWap3Nh9GQHTFIarPjIiC7U,5170
-sknetwork/linalg/svd_solver.py,sha256=vHcwG07cyxnm5KhHRVeJ0pZU5lg3u1uV1eOikCA6V8Y,2778
-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=F-LnXKwoQ3B7c2IuF7luNthz7HJOl9lIsdFfukDjBVo,3175
-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=Bjuwiep1ZckROUKGWpttZzo9pOR8ea-atCTxnGLcZDQ,788
-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=tTfCsZCydR5zWkwkJN6_9RwU7bOlG4IRtJy5TsCoKME,249
-sknetwork/path/metrics.py,sha256=d_ILvQKY8MWqjl5jny1jrLmZruMgGOUYf6BpRVzmlq8,5015
-sknetwork/path/search.py,sha256=3rXmt052El8R02XvpAlljGv03sQVtYJ-HeCApHShJrw,2568
-sknetwork/path/shortest_path.py,sha256=74JtUcxzcRS4GuHPqDvs_lc6nZpOlvbVspB8r6UkpTM,6911
-sknetwork/path/tests/__init__.py,sha256=ntNGJ8p6RZkIrYnePF-TESyoidEXx8fw6A9OBNAlIqo,29
-sknetwork/path/tests/test_metrics.py,sha256=O_5-2vtu5hG3csO_LuquMn8AidprDunZD7SVsnTi1_I,868
-sknetwork/path/tests/test_search.py,sha256=7-rrTJfw2l3D3kP-rauQJyD5lyvC_bO6kDUAB06A1xk,728
-sknetwork/path/tests/test_shortest_path.py,sha256=s973xj3Dp-Rh9nkOl-r8BdPtMlgIr-wXUwazZUSbaJw,1564
-sknetwork/ranking/__init__.py,sha256=88IDSo6q9uPCtMBUzAenq9Tfw5qC6xAN7wihCsQUmhg,405
-sknetwork/ranking/base.py,sha256=aYs2Jl_higrG1pyxgiPEgFPSp3C9nPtF3_BT3dYQlpI,1503
-sknetwork/ranking/betweenness.cp310-win_amd64.pyd,sha256=eEXs_VIYHvWyI3j5LFfim4FIgyUDXv5RmVwOrX9-JPo,75264
-sknetwork/ranking/betweenness.cpp,sha256=px19BV7kyhL8QiKXy5bAWDzJaZrHCLmNlySOwKvBzdg,281847
-sknetwork/ranking/betweenness.pyx,sha256=JsLjz9otsrPWMwGrN9wD0SzVZHdh4HwVAs9pZGSaw-M,3259
-sknetwork/ranking/closeness.py,sha256=ozR46X23EznYFwtt_xdPZVMd1jgRrhYbthja43d-wHs,3153
-sknetwork/ranking/harmonic.py,sha256=LbWpyOfsI98H3YNgHWDteCxWToBM5tnvf7LRLiUp2Jk,2385
-sknetwork/ranking/hits.py,sha256=uhGJH2C0U9hLsVRutI6M1ulbEIM7L6dCeYqiAhtTD9A,2855
-sknetwork/ranking/katz.py,sha256=WQpxJq_qqvjFm1ZG_P1ynfpzLlPu-dXCJ9luK-8sRjY,2618
-sknetwork/ranking/pagerank.py,sha256=r1zz9IiqMcX3k1nvcgc-144aIYej2jVACy_1hBUugO8,4853
-sknetwork/ranking/postprocess.py,sha256=3NyhVdywPZFC56TlhC4QcgL_vgtF4wpk0UotU_sZaOg,631
-sknetwork/ranking/tests/__init__.py,sha256=46AJCs9irV6PtFg8CVH8TqpqHA6ajs29-3rsL3zxZQ8,25
-sknetwork/ranking/tests/test_API.py,sha256=OqQmT_TCsABrtWx3L_2yq1Pd3Nm2snTu8_zvIJh3PIk,1194
-sknetwork/ranking/tests/test_betweenness.py,sha256=Ur1WM2PGNkciMbb99S7CrDkNkZIj1X-tVn-U2_gFAvs,1171
-sknetwork/ranking/tests/test_closeness.py,sha256=73xTsOpP5OUhA3J714pVlFWUrrLwry8dv9Oca8Fm1gM,1041
-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=krBSXLzmseTxjdwkMdlZu62bZ56kC4iCpIelFMLEmDI,524
-sknetwork/regression/__init__.py,sha256=FYnlc-DKS1Mz2lKVCtKldjSgtvzxMmkd5kwKq2HdNmE,145
-sknetwork/regression/base.py,sha256=6BpA7O3lVTwkYtaS9JlDaBOHvNVnQH7lrxD7pSYJiJ0,1129
-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=mafuxKAbQIlrM6i_9lPw0S6WhFR1AT6lKSaZDRD7uz4,456
-sknetwork/topology/dag.py,sha256=_5z1uy0D4zC2mF9vpfE0bYmNffcMkMIERGlCDbFTxa8,2396
-sknetwork/topology/dag_core.cp310-win_amd64.pyd,sha256=IDDODGSjYdYzOcHgpvKscBm1WQJLBehrmtJTDdYRJvw,198656
-sknetwork/topology/dag_core.cpp,sha256=t5vn8Jw_JrrQm-rSS9F1oegGZ7_CJo3ltm5WchB09ZE,874332
-sknetwork/topology/dag_core.pyx,sha256=GdWMM_4fn1tFxWJHThTqC8oxRGIzCtwd1DjOaEkH9fY,1046
-sknetwork/topology/kcliques.cp310-win_amd64.pyd,sha256=0Aum8dFG0QV3q3zgV7bqBq2ct9uvUMsoFtJhH793OGk,243712
-sknetwork/topology/kcliques.cpp,sha256=59Hv1hUvBT23SBeIcHn60RnoyF89Cel6RToSfMnhd00,1103591
-sknetwork/topology/kcliques.pyx,sha256=qhm0ENqqPngm5y_1Hxgt8Zjtaba5gMKlPAolHsUNBqU,5314
-sknetwork/topology/kcore.cp310-win_amd64.pyd,sha256=k4W-37ZDltyxHAgZhYCeoX8xrxEZqBRVKFXrAHEYZag,218624
-sknetwork/topology/kcore.cpp,sha256=iiQrdVQYfrjgJEJdGI_6MJB6TlqN6B4DdNzyGqZp9OQ,1029784
-sknetwork/topology/kcore.pyx,sha256=A7rX7-WiffMOSuOrVfSBWa_A14antAlu6rvrXTVrVTI,3500
-sknetwork/topology/structure.py,sha256=ZN8Oz2pCtDPgadvzAtTpaeBrGip564vWz9XVKJaUR8E,8856
-sknetwork/topology/triangles.cp310-win_amd64.pyd,sha256=eQfy0oK7AiuMQcrQaX8j5pXUHJSk7Pr2O0TWtXprmAE,60416
-sknetwork/topology/triangles.cpp,sha256=wshfOPgRhuBY4sICklafPmLBhvJeDQwBye0Mabi-QWA,258294
-sknetwork/topology/triangles.pyx,sha256=ra1CSDDCdlEqZ1VTqS6Gv62MabhYg2bQ60M9ybPtZJw,4811
-sknetwork/topology/weisfeiler_lehman.py,sha256=MLCM7ViRuYl4tj5hjlB34iulD0Z1COYIaT52JQLBNEI,5473
-sknetwork/topology/weisfeiler_lehman_core.cp310-win_amd64.pyd,sha256=afAAwqJ1RYnqe45-N2TqEXq_tjAYO5gtvHc4jLOJiJY,205312
-sknetwork/topology/weisfeiler_lehman_core.cpp,sha256=hklfTm2NGrMz_ZOkCztULYJVI1VDpvsO_bY4DjKdZ6w,880493
-sknetwork/topology/weisfeiler_lehman_core.pyx,sha256=Tg690FqNjoCaxd1KeOKY5fFrEGEnmeShc1NkvhIbw7U,3223
-sknetwork/topology/tests/__init__.py,sha256=84T-xv8JCFeA9D7Rxw9gy3_dNAoE8CY1k1pYcuG8K3s,26
-sknetwork/topology/tests/test_cliques.py,sha256=33JZ78-su0he3S_vk8U7sna__Gvyo2oaUI-KgcQ1LIY,929
-sknetwork/topology/tests/test_cores.py,sha256=e7EcpX5ah-XY3B4oAg__XfpQXYHahNrRnyGRSS6W390,628
-sknetwork/topology/tests/test_dag.py,sha256=j0YOY-HTLopB3revJCpCVhSUvKJNUkgro4iiOw-nbMY,680
-sknetwork/topology/tests/test_structure.py,sha256=MJcPSCNSxairXVc_FO4nCsqJu7f_-zyy1VC4sFL8b90,4734
-sknetwork/topology/tests/test_triangles.py,sha256=k8wc7ZFrHcSUnfdViHQHAZjYT8rYz6qUoYiDQPXaBmQ,1384
-sknetwork/topology/tests/test_wl_coloring.py,sha256=ENzomssejjvsjD6mDjTsgoXHlR8OPAOQ_AFOsK3sjmo,1697
-sknetwork/topology/tests/test_wl_kernel.py,sha256=8j0bRgbyy2mKMvEFs8bfTimU35f3gbwlLQu4w8WqeQc,864
-sknetwork/utils/__init__.py,sha256=poK60DO1CGqGenK6zCbQX31YKTMzJ9d7_jbf0xPjQ0k,1052
-sknetwork/utils/base.py,sha256=7Zd65d8p0Xh6jsPGdKnmnBCPJ1R3V6DaodeFYGAlGS4,1086
-sknetwork/utils/check.py,sha256=3sHaRmLM9XsyX-wEi4o1r_c8QMQfV8jwmEeqS5ntrS4,13248
-sknetwork/utils/format.py,sha256=xMDHgcqCSYzOejy7OJiA_R2CtS0aFheAy6jJbGaSquY,8845
-sknetwork/utils/membership.py,sha256=claXsrZd6BVT4WuuI0P00tqapbczvAxtLAWMWNQ78KE,2234
-sknetwork/utils/minheap.cp310-win_amd64.pyd,sha256=PD0tQux9lcgQRR7ldDIaqsm6ugLbYEj2J1D8_2ROWh4,187392
-sknetwork/utils/minheap.cpp,sha256=5-Mz_5BFVUK3mOUAl3KYvNFwOI8E736TgCB824NWA78,866948
-sknetwork/utils/minheap.pxd,sha256=KP710yK0fKOpnN7d87LSYyRuipzgNUd-YqfTN0fbmx0,661
-sknetwork/utils/minheap.pyx,sha256=mr6VIqK-0SGprUHmKhduuu9D-e8LULavdbR9BYeHHyE,3496
-sknetwork/utils/neighbors.py,sha256=-EwBXigM3mn2qvVTi_aPmG0XifDMojZgsMQ9_A8cLkk,3466
-sknetwork/utils/simplex.py,sha256=uEO_mcZCb9YMHCAK3DIlYM0YpkH3ZAcQxD9SgmVKz3M,4384
-sknetwork/utils/tfidf.py,sha256=vvISEaZJa7RZrNNgQEAHgMH2rJToARuNWcVjnA8u7po,993
-sknetwork/utils/timeout.py,sha256=mXSqgKFRc6AVZBlIobN2xPYJjAyQOClKH3KQJ5M_4Sw,1085
-sknetwork/utils/values.py,sha256=Y0GYTazOV9Sh_8BQC_yjleoUyx2Tjz9G2EYSu_IZAxM,2583
-sknetwork/utils/verbose.py,sha256=9-R6D5s217EsCzA7D-IPHbNLfFIBEiLw9xua2CyAoAU,988
-sknetwork/utils/tests/__init__.py,sha256=JQuARG8Ycb5apL6PUy_wuEHsLjmEZFOPQUKWRgTMdCY,23
-sknetwork/utils/tests/test_base.py,sha256=RmS70uR6F0p5k2yBqPKViGbfpAmEwO3Rx1JuFYZmIO4,851
-sknetwork/utils/tests/test_bunch.py,sha256=eZIQEzd-Hc4uixoarEjsuS_uJQO2_b0d-eO1Ygpw1Ho,351
-sknetwork/utils/tests/test_check.py,sha256=R3AB9OmBIHE7hO_LfNLzRfJJuOYQxDWY3M9tSvDs7zY,6948
-sknetwork/utils/tests/test_format.py,sha256=_88lJ6Ewpr8mro8gyuq6Kj-inN6-W5GeZdTlZN0GzmY,2175
-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_projection_simplex.py,sha256=hBXbJc-G2v7Qr9m97gYoznHbs5blEzIk48NmdEjhaIQ,892
-sknetwork/utils/tests/test_tfidf.py,sha256=KYz_LSxi625kKL-v5-uA1-YQOliIfgXCmNXTAZtgpmw,463
-sknetwork/utils/tests/test_values.py,sha256=K3ctTXpSy9fwiHnpFVlHX5KeTd2wNF4kbFiTXe_gQq8,2334
-sknetwork/utils/tests/test_verbose.py,sha256=TlQ3JdO08lL_01A0RXKelnU9cMdUp6IWxNhBT6QG6Ko,410
-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=nhxU9VuvP6Y9C2e1ND7tkssdewAXp4Hu0yp6GIjmrXo,32740
-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=63ISDfBHE9JQOeyXSjKuwD3ZVl3CnJ0vnrqrhqj3L_I,8885
-scikit_network-0.30.0.dist-info/AUTHORS.rst,sha256=SSAG2WortFtGW_lEWFDX15zhkIvoEOwc60q2yVTRN7Q,921
-scikit_network-0.30.0.dist-info/LICENSE,sha256=BJ1Hth1QjBmjIfHcp1sVxlkEqHYM58Vn5bcpYcggMZE,1656
-scikit_network-0.30.0.dist-info/METADATA,sha256=yCsGNB0LVK9CXyw6lyiFhEYHSBCdHRLMjyFxgCivvjY,14068
-scikit_network-0.30.0.dist-info/WHEEL,sha256=rneS2j8QNmAwdNKHN86s6-qP7AMcWZgqiEoH3bdbh_Y,102
-scikit_network-0.30.0.dist-info/top_level.txt,sha256=fkwspWQ9B3csqb5ENEOoVciRY6XftnMuz4MvTDQeSsg,10
-scikit_network-0.30.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_graph_disconnect, 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_graph_disconnect(), 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))