⬆️ minor fix

cdlib/test/test_community_discovery_models.py

@@ -348,6 +348,8 @@ def test_markov_clustering(self):
                 self.assertEqual(type(communities.communities[0][0]), int)
 
     def test_bigClam(self):
+        if karateclub is None:
+            return
         g = nx.karate_club_graph()
         coms = algorithms.big_clam(g)
         self.assertEqual(type(coms.communities), list)
@@ -478,6 +480,8 @@ def test_sbm_nested_dl(self):
                 self.assertEqual(type(coms.communities[0][0]), str)
 
     def test_danmf(self):
+        if karateclub is None:
+            return
         g = get_string_graph()
         coms = algorithms.danmf(g)
         self.assertEqual(type(coms.communities), list)
@@ -486,6 +490,8 @@ def test_danmf(self):
             self.assertEqual(type(coms.communities[0][0]), str)
 
     def test_egonet_splitter(self):
+        if karateclub is None:
+            return
         g = get_string_graph()
         coms = algorithms.egonet_splitter(g)
         self.assertEqual(type(coms.communities), list)
@@ -494,6 +500,8 @@ def test_egonet_splitter(self):
             self.assertEqual(type(coms.communities[0][0]), str)
 
     def test_nnsed(self):
+        if karateclub is None:
+            return
         g = nx.karate_club_graph()
         coms = algorithms.nnsed(g)
         self.assertEqual(type(coms.communities), list)
@@ -502,6 +510,8 @@ def test_nnsed(self):
             self.assertEqual(type(coms.communities[0][0]), int)
 
     def test_mnmf(self):
+        if karateclub is None:
+            return
         g = nx.karate_club_graph()
         coms = algorithms.mnmf(g)
         self.assertEqual(type(coms.communities), list)
@@ -510,6 +520,8 @@ def test_mnmf(self):
             self.assertEqual(type(coms.communities[0][0]), int)
 
     def test_edmot(self):
+        if karateclub is None:
+            return
         g = nx.karate_club_graph()
         coms = algorithms.edmot(g)
         self.assertEqual(type(coms.communities), list)
@@ -625,7 +637,8 @@ def test_CPM_Bipartite(self):
         g = ig.Graph.Erdos_Renyi(n=80, m=600)
         g.vs["type"] = 0
         g.vs[15:]["type"] = 1
-
+        if leidenalg is None:
+            return
         coms = algorithms.CPM_Bipartite(g, 0.3)
         self.assertEqual(type(coms.communities), list)
         if len(coms.communities) > 0:
@@ -640,6 +653,8 @@ def test_CPM_Bipartite(self):
             self.assertEqual(type(coms.communities[0][0]), int)
 
     def test_infomap_Bipartite(self):
+        if infomap is None:
+            return
         g = nx.algorithms.bipartite.random_graph(300, 100, 0.2)
         coms = algorithms.infomap_bipartite(g)
         self.assertEqual(type(coms.communities), list)
@@ -788,6 +803,8 @@ def test_kcut(self):
             print("Kcut error to be checked (conda packaging)")
 
     def test_symmnmf(self):
+        if karateclub is None:
+            return
         G = nx.karate_club_graph()
 
         coms = algorithms.symmnmf(G)
@@ -806,6 +823,8 @@ def test_scd(self):
             self.assertEqual(type(coms.communities[0][0]), int)
 
     def test_gemsec(self):
+        if karateclub is None:
+            return
         G = nx.karate_club_graph()
 
         coms = algorithms.gemsec(G)