nw:maximal-cliques
nw:maximal-cliques
A clique is a subset of a network in which every node has a direct link to every other node. A maximal clique is a clique that is not, itself, contained in a bigger clique.
The result is reported as a list of agentsets, in random order. Note that one turtle can be a member of more than one maximal clique at once.
The primitive uses the Bron–Kerbosch algorithm and only works with undirected links.
Take me to the full Networks Extension Dictionary