From 7c72a26308dc22a209b0a0861d91c7c9d287bcb5 Mon Sep 17 00:00:00 2001 From: Thomas Bonald Date: Wed, 27 Mar 2024 21:47:01 +0100 Subject: [PATCH] PEP8 tests --- sknetwork/clustering/tests/test_kcenters.py | 30 ++++++++++----------- 1 file changed, 14 insertions(+), 16 deletions(-) diff --git a/sknetwork/clustering/tests/test_kcenters.py b/sknetwork/clustering/tests/test_kcenters.py index 51bcc3eb..20aeaa22 100644 --- a/sknetwork/clustering/tests/test_kcenters.py +++ b/sknetwork/clustering/tests/test_kcenters.py @@ -7,8 +7,9 @@ from sknetwork.data import karate_club, painters, star_wars from sknetwork.data.test_graphs import * + class TestKCentersClustering(unittest.TestCase): - + def test_kcenters(self): # Test undirected graph n_clusters = 2 @@ -16,16 +17,16 @@ def test_kcenters(self): n_row = adjacency.shape[0] kcenters = KCenters(n_clusters=n_clusters) labels = kcenters.fit_predict(adjacency) - self.assertEqual(len(labels), n_row) + self.assertEqual(len(labels), n_row) self.assertEqual(len(set(labels)), n_clusters) - # Test directed graph + # Test directed graph n_clusters = 3 adjacency = painters() n_row = adjacency.shape[0] kcenters = KCenters(n_clusters=n_clusters, directed=True) labels = kcenters.fit_predict(adjacency) - self.assertEqual(len(labels), n_row) + self.assertEqual(len(labels), n_row) self.assertEqual(len(set(labels)), n_clusters) # Test bipartite graph @@ -38,9 +39,9 @@ def test_kcenters(self): self.assertEqual(len(kcenters.labels_row_), n_row) self.assertEqual(len(kcenters.labels_col_), n_col) self.assertEqual(len(set(labels)), n_clusters) - + def test_kcenters_centers(self): - # Test centers for undirected graphs + # Test centers for undirected graphs n_clusters = 2 adjacency = karate_club() kcenters = KCenters(n_clusters=n_clusters) @@ -48,7 +49,7 @@ def test_kcenters_centers(self): centers = kcenters.centers_ self.assertEqual(n_clusters, len(set(centers))) - # Test centers for bipartite graphs + # Test centers for bipartite graphs n_clusters = 2 biadjacency = star_wars() n_row, n_col = biadjacency.shape @@ -56,15 +57,15 @@ def test_kcenters_centers(self): kcenters = KCenters(n_clusters=n_clusters, center_position=position) kcenters.fit(biadjacency) centers_row = kcenters.centers_row_ - centers_col = kcenters.centers_col_ + centers_col = kcenters.centers_col_ if position == "row": self.assertEqual(n_clusters, len(set(centers_row))) self.assertTrue(np.all(centers_row < n_row)) - self.assertTrue(centers_col==None) + self.assertTrue(centers_col is None) if position == "col": self.assertEqual(n_clusters, len(set(centers_col))) self.assertTrue(np.all((centers_col < n_col) & (0 <= centers_col))) - self.assertTrue(centers_row==None) + self.assertTrue(centers_row is None) if position == "both": self.assertEqual(n_clusters, len(set(centers_row)) + len(set(centers_col))) self.assertTrue(np.all(centers_row < n_row)) @@ -74,21 +75,18 @@ def test_kcenters_error(self): # Test value errors adjacency = karate_club() biadjacency = star_wars() - + # test n_clusters error kcenters = KCenters(n_clusters=1) with self.assertRaises(ValueError): kcenters.fit(adjacency) - # test n_init error + # test n_init error kcenters = KCenters(n_clusters=2, n_init=0) with self.assertRaises(ValueError): kcenters.fit(adjacency) - # test center_position error + # test center_position error kcenters = KCenters(n_clusters=2, center_position="other") with self.assertRaises(ValueError): kcenters.fit(biadjacency) - - -