[{"data":1,"prerenderedAt":120},["ShallowReactive",2],{"/nw/maximal-cliques":3,"/nw/maximal-cliques-surround":109},{"id":4,"title":5,"body":6,"description":75,"extension":76,"meta":77,"navigation":95,"path":105,"seo":106,"stem":107,"__hash__":108},"content/nw/maximal-cliques.md","Networks Extension Dictionary: maximal-cliques",{"type":7,"value":8,"toc":65},"minimark",[9],[10,11,15,16,15,26,42,53,56],"div",{"className":12,"id":14},[13],"dict_entry","maximal-cliques","\n  ",[17,18,20,21,15],"h3",{"id":19},"nwmaximal-cliques","\n    ",[22,23,25],"a",{"href":24},"#maximal-cliques","nw:maximal-cliques",[27,28,32],"h4",{"id":29,"className":30},"nwmaximal-cliques-1",[31],"section-heading",[22,33,20,37,15],{"className":34,"href":36},[35],"section-anchor","#----nwmaximal-cliques---1",[38,39,25],"span",{"className":40},[41],"prim_example",[43,44,45,46,52],"p",{},"A ",[22,47,51],{"href":48,"rel":49},"https://en.wikipedia.org/wiki/Clique_%28graph_theory%29",[50],"nofollow","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.",[43,54,55],{},"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.",[43,57,58,59,64],{},"The primitive uses the ",[22,60,63],{"href":61,"rel":62},"https://en.wikipedia.org/wiki/Bron%E2%80%93Kerbosch_algorithm",[50],"Bron–Kerbosch algorithm"," and only works with undirected links.",{"title":66,"searchDepth":67,"depth":68,"links":69},"",5,3,[70],{"id":19,"depth":68,"text":71,"children":72},"\n    nw:maximal-cliques\n  ",[73],{"id":29,"depth":74,"text":71},4,"Documentation for the maximal-cliques primitive.","md",{"source":78,"metadataOutputPath":79,"projectConfig":80,"language":88,"inheritFrom":96,"output":95,"version":81,"layout":97,"dictionaryDisplayName":98,"dictionaryHomeDirectory":99,"indexFileURI":100,"currentItemId":14,"currentItemLabel":25,"primRoot":101,"icon":102,"extensionName":103,"assetsRoot":83},"../../external/extensions/nw/nw/maximal-cliques.md","content/nw/maximal-cliques.metadata.yaml",{"version":81,"projectRoot":82,"scanRoot":83,"outputRoot":84,"defaults":85,"engine":91,"partials":92,"dedupeIdenticalDiskWrites":95},"7.0.4",".","/home/runner/work/Helio/Helio/external/extensions/nw","content",{"inheritFrom":86,"language":88,"output":89,"extension":76,"title":90,"version":81},[87],0,"en",false,"NetLogo User Manual","mustache",{"directoryPaths":93,"extensions":94},[82],[91,76],true,[87],"catalog","Networks Extension Dictionary","/nw.html","/_index/extensions/nw.txt","nw","i-lucide-network",{"shortName":101,"fullName":104},"Networks","/nw/maximal-cliques",{"title":5,"description":75},"nw/maximal-cliques","pu9wCAsc-NdW9DT7oaHOjhk1Ikv2_C_ptTYRpI3Za9c",[110,115],{"title":111,"path":112,"stem":113,"description":114},"Networks Extension Dictionary: louvain-communities","/nw/louvain-communities","nw/louvain-communities","Documentation for the louvain-communities primitive.",{"title":116,"path":117,"stem":118,"description":119},"Networks Extension Dictionary: mean-path-length","/nw/mean-path-length","nw/mean-path-length","Documentation for the mean-path-length primitive.",1777657885803]