def _highest_cset_entropy(graph):
return CoherentCandidatePruner._get_entropy(
graph,
CoherentCandidatePruner._get_highest_ent_source_node(graph))
def test_mge_cutoff(self):
pruner = CoherentCandidatePruner(cutoff = 'graph_mean_entropy')
pruned_graphs = pruner(self.graphs, copy = True)
for p_g, g in zip(pruned_graphs, self.graphs):
assert _highest_cset_entropy(p_g) < pruner._mean_graph_entropy(g)
