def test_disconnected_communites(self):
graph = nx.Graph([(0,1),(1,2),(2,0),(3,4),(3,5),(4,5)])
partition = wm.WeightedPartition(graph, communities=[set([0, 1, 2]), set([3, 4, 5])])
wcd = nr.within_community_degree(partition)
self.assertAlmostEqual(wcd, {0: 0.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0, 5: 0.0})
pc = nr.participation_coefficient(partition)
self.assertEqual(pc, {0: 0.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0, 5: 0.0})
def test_disconnected_communites(self):
graph = nx.Graph([(0, 1), (1, 2), (2, 0), (3, 4), (3, 5), (4, 5)])
partition = wm.WeightedPartition(
graph, communities=[set([0, 1, 2]), set([3, 4, 5])])
wcd = nr.within_community_degree(partition)
self.assertAlmostEqual(wcd, {
0: 0.0,
1: 0.0,
2: 0.0,
3: 0.0,
4: 0.0,
5: 0.0
})
pc = nr.participation_coefficient(partition)
self.assertEqual(pc, {0: 0.0, 1: 0.0, 2: 0.0, 3: 0.0, 4: 0.0, 5: 0.0})
def test_high_low_wcd(self):
graph = nx.Graph([(0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (6, 7),
(7, 8), (8, 6)])
partition = wm.WeightedPartition(
graph, communities=[set([0, 1, 2, 3, 4, 5]),
set([8, 6, 7])])
wcd = nr.within_community_degree(partition)
self.assertAlmostEqual(
wcd, {
0: 2.2360679774997898,
1: -0.44721359549995804,
2: -0.44721359549995804,
3: -0.44721359549995804,
4: -0.44721359549995804,
5: -0.44721359549995804,
6: 0.0,
7: 0.0,
8: 0.0
})
def test_high_low_wcd(self):
graph = nx.Graph([(0,1),(0,2),(0,3),(0,4),(0,5),(6,7),(7,8),(8,6)])
partition = wm.WeightedPartition(graph, communities=[set([0, 1, 2, 3, 4, 5]), set([8, 6, 7])])
wcd = nr.within_community_degree(partition)
self.assertAlmostEqual(wcd, {0: 2.2360679774997898, 1: -0.44721359549995804, 2: -0.44721359549995804, 3: -0.44721359549995804, 4: -0.44721359549995804, 5: -0.44721359549995804, 6: 0.0, 7: 0.0, 8: 0.0})