structify_net.zoo.sort_largest_disconnected_cliques
- structify_net.zoo.sort_largest_disconnected_cliques(nodes, m)
A rank model based on the largest disconnected cliques
Computes the largest possible number of cliques of size k such that the number of edges is less than m. Then, the rank model is the same as for assortative blocks.
- Args:
nodes (_type_): Nodes of the graph, either as a networkx graph (node names and node attributes are preserved) or an integer (number of nodes) m (_type_): number of edges. This is required to compute the largest possible number of cliques.
- Returns:
structify_net.Rank_model
:: _description_