def test_link_modularity(self):
g = nx.karate_club_graph()
communities = louvain(g)
mod = evaluation.link_modularity(g, communities)
self.assertLessEqual(mod.score, 1)
self.assertGreaterEqual(mod.score, 0)
def link_modularity(self):
"""
Quality function designed for directed graphs with overlapping communities.
:return: the link modularity score
:Example:
>>> from cdlib import evaluation
>>> from cdlib.algorithms import louvain
>>> g = nx.karate_club_graph()
>>> communities = louvain(g)
>>> mod = communities.link_modularity()
"""
if self.__check_graph():
return evaluation.link_modularity(self.graph, self)
else:
raise ValueError("Graph instance not specified")
