⬆️ Louvain initial partition

GiulioRossetti · May 13, 2024 · 04d3f0d · 04d3f0d
1 parent d46a542
commit 04d3f0d
Show file tree

Hide file tree

Showing 2 changed files with 19 additions and 2 deletions.
diff --git a/cdlib/algorithms/crisp_partition.py b/cdlib/algorithms/crisp_partition.py
@@ -493,7 +493,7 @@ def agdl(g_original: object, number_communities: int, kc: int) -> NodeClustering
 
 def louvain(
     g_original: object,
-    partition: None,
+    partition: NodeClustering = None,
     weight: str = "weight",
     resolution: float = 1.0,
     randomize: int = None,
@@ -541,8 +541,19 @@ def louvain(
 
     g = convert_graph_formats(g_original, nx.Graph)
 
+    if partition is not None:
+        communities = {}
+        for idc, com in enumerate(partition.communities):
+            for n in com:
+                communities[n] = idc
+        partition = communities
+
     coms = community_louvain.best_partition(
-        g, partition=partition, weight=weight, resolution=resolution, randomize=randomize
+        g,
+        partition=partition,
+        weight=weight,
+        resolution=resolution,
+        randomize=randomize,
     )
 
     # Reshaping the results

diff --git a/cdlib/test/test_community_discovery_models.py b/cdlib/test/test_community_discovery_models.py
@@ -134,6 +134,12 @@ def test_louvain(self):
             self.assertEqual(type(coms.communities[0]), list)
             self.assertEqual(type(coms.communities[0][0]), str)
 
+        coms2 = algorithms.louvain(g, partition=coms)
+        self.assertEqual(type(coms2.communities), list)
+        if len(coms2.communities) > 0:
+            self.assertEqual(type(coms2.communities[0]), list)
+            self.assertEqual(type(coms2.communities[0][0]), str)
+
     def test_leiden(self):
         if leidenalg is not None:
             g = get_string_graph()