4.11.2 full_meshes(ClusterInfo) ¶

-spec
     full_meshes(classy:cluster_info()) -> #{classy:cluster_id()
                                                 =>
                                                 [partition()]}.

This greedy algorithm finds fully connected digraphs in the network in such a way that each site appears in exactly one full mesh. Because of this property, this function returns ambiguous results when network partitions are overlapping. More specifically, it will be overly eager in detecting partitions, and will ignore some existing links.