nw:biggest-maximal-cliques
nw:biggest-maximal-cliques
The biggest maximal cliques are, as the name implies, the biggest cliques in the current context. Often, more than one clique are tied for the title of biggest clique, so the result is reported as a list of agentsets, in random order. If you want only one clique, use one-of nw:biggest-maximal-cliques
.
The primitive uses the Bron–Kerbosch algorithm and only works with undirected links.
Take me to the full Networks Extension Dictionary