{"algorithm":"maximal-cliques","about":["A clique is a set of vertices where every two are joined by an edge. It is maximal when no other vertex is joined to all of them, so it can't grow. partition.MaximalCliques lists every maximal clique with the Bron-Kerbosch algorithm. It grows a clique one vertex at a time from a set of candidates, and keeps the vertices it has already tried so that no clique is listed twice.","gograph adds three things that make it faster. It starts from the vertices in degeneracy order, which keeps the candidate sets small in sparse graphs. At each step it picks a pivot and only branches on candidates that aren't the pivot's neighbors, since every maximal clique holds the pivot or one of those. And it stores the sets as bitsets, so comparing them is quick.","A graph can have up to 3^(V/3) maximal cliques, so no method is fast on every graph, but real networks are usually sparse enough. Edge directions are ignored, and so are self-loops. Use it to find tight groups of friends or devices that are all linked, where one vertex can belong to several groups."],"template":{"id":"karate-club","name":"Karate club","description":"The 34 members of a university karate club, numbered 1 to 34 as in the study. Each edge joins two members who also spent time together outside the club's classes and meetings. A dispute between the instructor (1) and an officer (34) split the club in two, and most members sit near the side they joined.","family":"undirected","directed":false,"weighted":false,"acyclic":false,"vertices":[{"id":"1","x":590,"y":680},{"id":"2","x":640,"y":560},{"id":"3","x":420,"y":520},{"id":"4","x":470,"y":760},{"id":"5","x":680,"y":850},{"id":"6","x":750,"y":860},{"id":"7","x":820,"y":760},{"id":"8","x":390,"y":660},{"id":"9","x":520,"y":430},{"id":"10","x":590,"y":230},{"id":"11","x":590,"y":930},{"id":"12","x":400,"y":900},{"id":"13","x":490,"y":890},{"id":"14","x":590,"y":480},{"id":"15","x":460,"y":80},{"id":"16","x":380,"y":70},{"id":"17","x":950,"y":940},{"id":"18","x":830,"y":560},{"id":"19","x":540,"y":110},{"id":"20","x":770,"y":450},{"id":"21","x":90,"y":220},{"id":"22","x":820,"y":640},{"id":"23","x":290,"y":70},{"id":"24","x":120,"y":300},{"id":"25","x":120,"y":690},{"id":"26","x":50,"y":570},{"id":"27","x":220,"y":60},{"id":"28","x":210,"y":490},{"id":"29","x":390,"y":440},{"id":"30","x":170,"y":190},{"id":"31","x":640,"y":300},{"id":"32","x":280,"y":570},{"id":"33","x":250,"y":340},{"id":"34","x":440,"y":260}],"edges":[{"from":"1","to":"2"},{"from":"1","to":"3"},{"from":"1","to":"4"},{"from":"1","to":"5"},{"from":"1","to":"6"},{"from":"1","to":"7"},{"from":"1","to":"8"},{"from":"1","to":"9"},{"from":"1","to":"11"},{"from":"1","to":"12"},{"from":"1","to":"13"},{"from":"1","to":"14"},{"from":"1","to":"18"},{"from":"1","to":"20"},{"from":"1","to":"22"},{"from":"1","to":"32"},{"from":"2","to":"3"},{"from":"2","to":"4"},{"from":"2","to":"8"},{"from":"2","to":"14"},{"from":"2","to":"18"},{"from":"2","to":"20"},{"from":"2","to":"22"},{"from":"2","to":"31"},{"from":"3","to":"4"},{"from":"3","to":"8"},{"from":"3","to":"9"},{"from":"3","to":"10"},{"from":"3","to":"14"},{"from":"3","to":"28"},{"from":"3","to":"29"},{"from":"3","to":"33"},{"from":"4","to":"8"},{"from":"4","to":"13"},{"from":"4","to":"14"},{"from":"5","to":"7"},{"from":"5","to":"11"},{"from":"6","to":"7"},{"from":"6","to":"11"},{"from":"6","to":"17"},{"from":"7","to":"17"},{"from":"9","to":"31"},{"from":"9","to":"33"},{"from":"9","to":"34"},{"from":"10","to":"34"},{"from":"14","to":"34"},{"from":"15","to":"33"},{"from":"15","to":"34"},{"from":"16","to":"33"},{"from":"16","to":"34"},{"from":"19","to":"33"},{"from":"19","to":"34"},{"from":"20","to":"34"},{"from":"21","to":"33"},{"from":"21","to":"34"},{"from":"23","to":"33"},{"from":"23","to":"34"},{"from":"24","to":"26"},{"from":"24","to":"28"},{"from":"24","to":"30"},{"from":"24","to":"33"},{"from":"24","to":"34"},{"from":"25","to":"26"},{"from":"25","to":"28"},{"from":"25","to":"32"},{"from":"26","to":"32"},{"from":"27","to":"30"},{"from":"27","to":"34"},{"from":"28","to":"34"},{"from":"29","to":"32"},{"from":"29","to":"34"},{"from":"30","to":"33"},{"from":"30","to":"34"},{"from":"31","to":"33"},{"from":"31","to":"34"},{"from":"32","to":"33"},{"from":"32","to":"34"},{"from":"33","to":"34"}],"source":"W. W. Zachary, \"An information flow model for conflict and fission in small groups\", Journal of Anthropological Research 33 (1977).","details":{"vertices":34,"edges":78,"directed":false,"weighted":false,"acyclic":false,"negativeWeights":false,"density":0.13903743315508021,"degree":{"min":1,"avg":4.588235294117647,"max":17},"selfLoops":0,"components":1}},"problem":"Which groups of members all spent time with each other outside the club, where no other member spent time with all of them?","params":{},"result":{"kind":"sets","sets":[["1","2","3","4","8"],["1","2","3","4","14"],["1","2","18"],["1","2","20"],["1","2","22"],["1","3","9"],["1","4","13"],["1","5","7"],["1","5","11"],["1","6","7"],["1","6","11"],["1","12"],["1","32"],["2","31"],["3","9","33"],["3","10"],["3","28"],["3","29"],["6","7","17"],["9","31","33","34"],["10","34"],["14","34"],["15","33","34"],["16","33","34"],["19","33","34"],["20","34"],["21","33","34"],["23","33","34"],["24","26"],["24","28","34"],["24","30","33","34"],["25","26","32"],["25","28"],["27","30","34"],["29","32","34"],["32","33","34"]]},"answer":"The graph has 36 maximal cliques. The 2 largest have 5 vertices each: 1, 2, 3, 4 and 8; 1, 2, 3, 4 and 14.","legend":{"vertex":[{"id":"idle","label":"Not in R, P or X","color":"#64748B","shape":"hollow"},{"id":"waiting","label":"In P, can join R","color":"#E69F00","shape":"dashed-square"},{"id":"current","label":"In R, the clique so far","color":"#56B4E9","shape":"ring"},{"id":"done","label":"In X, already covered","color":"#009E73","shape":"filled"}],"edge":[{"id":"idle","label":"Edge","color":"#475569","shape":"line"},{"id":"tree","label":"Joins two vertices of R","color":"#009E73","shape":"thick"}],"panels":[{"id":"r","title":"R, the clique so far","kind":"list"},{"id":"p","title":"P, can join R","kind":"list"},{"id":"x","title":"X, already covered","kind":"list"},{"id":"starts","title":"Starts left, in degeneracy order","kind":"list"},{"id":"cliques","title":"Maximal cliques found","kind":"groups"}]},"steps":[{"say":"Bron-Kerbosch grows a clique R. P holds the vertices that can still join R, and X holds the ones that could join but whose cliques were listed already. The search starts once from each vertex, in degeneracy order: repeatedly remove the vertex with the fewest neighbors left. That keeps P small. Each call picks a pivot in P or X with the most neighbors in P and tries only the vertices of P that are not its neighbors.","ops":[{"panel":"starts","list":[{"key":"12"},{"key":"16"},{"key":"17"},{"key":"18"},{"key":"19"},{"key":"21"},{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"Start from 12, the first vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 to R. P and X are both empty, so no other vertex is adjacent to both 12 and 1. Record them as maximal clique 1.","ops":[{"v":"1","state":"current"},{"v":"12","state":"current"},{"e":["12","1"],"state":"tree"},{"panel":"r","list":[{"key":"12"},{"key":"1"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"16"},{"key":"17"},{"key":"18"},{"key":"19"},{"key":"21"},{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"]]}]},{"say":"Start from 16, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 33 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 16, 33 and 34. Record them as maximal clique 2.","ops":[{"v":"1","state":"idle"},{"v":"12","state":"idle"},{"v":"16","state":"current"},{"v":"33","state":"current"},{"v":"34","state":"current"},{"e":["12","1"],"state":"idle"},{"e":["16","33"],"state":"tree"},{"e":["16","34"],"state":"tree"},{"e":["33","34"],"state":"tree"},{"panel":"r","list":[{"key":"16"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"17"},{"key":"18"},{"key":"19"},{"key":"21"},{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"]]}]},{"say":"Start from 17, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 6 and 7 to R. P and X are both empty, so no other vertex is adjacent to all of 17, 6 and 7. Record them as maximal clique 3.","ops":[{"v":"6","state":"current"},{"v":"7","state":"current"},{"v":"16","state":"idle"},{"v":"17","state":"current"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["16","33"],"state":"idle"},{"e":["16","34"],"state":"idle"},{"e":["33","34"],"state":"idle"},{"e":["17","6"],"state":"tree"},{"e":["17","7"],"state":"tree"},{"e":["6","7"],"state":"tree"},{"panel":"r","list":[{"key":"17"},{"key":"6"},{"key":"7"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"18"},{"key":"19"},{"key":"21"},{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"]]}]},{"say":"Start from 18, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 2 to R. P and X are both empty, so no other vertex is adjacent to all of 18, 1 and 2. Record them as maximal clique 4.","ops":[{"v":"1","state":"current"},{"v":"2","state":"current"},{"v":"6","state":"idle"},{"v":"7","state":"idle"},{"v":"17","state":"idle"},{"v":"18","state":"current"},{"e":["17","6"],"state":"idle"},{"e":["17","7"],"state":"idle"},{"e":["6","7"],"state":"idle"},{"e":["18","1"],"state":"tree"},{"e":["18","2"],"state":"tree"},{"e":["1","2"],"state":"tree"},{"panel":"r","list":[{"key":"18"},{"key":"1"},{"key":"2"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"19"},{"key":"21"},{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"]]}]},{"say":"Start from 19, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 33 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 19, 33 and 34. Record them as maximal clique 5.","ops":[{"v":"1","state":"idle"},{"v":"2","state":"idle"},{"v":"18","state":"idle"},{"v":"19","state":"current"},{"v":"33","state":"current"},{"v":"34","state":"current"},{"e":["18","1"],"state":"idle"},{"e":["18","2"],"state":"idle"},{"e":["1","2"],"state":"idle"},{"e":["19","33"],"state":"tree"},{"e":["19","34"],"state":"tree"},{"e":["33","34"],"state":"tree"},{"panel":"r","list":[{"key":"19"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"21"},{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"]]}]},{"say":"Start from 21, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 33 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 21, 33 and 34. Record them as maximal clique 6.","ops":[{"v":"19","state":"idle"},{"v":"21","state":"current"},{"e":["19","33"],"state":"idle"},{"e":["19","34"],"state":"idle"},{"e":["21","33"],"state":"tree"},{"e":["21","34"],"state":"tree"},{"panel":"r","list":[{"key":"21"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"22"},{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"]]}]},{"say":"Start from 22, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 2 to R. P and X are both empty, so no other vertex is adjacent to all of 22, 1 and 2. Record them as maximal clique 7.","ops":[{"v":"1","state":"current"},{"v":"2","state":"current"},{"v":"21","state":"idle"},{"v":"22","state":"current"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["21","33"],"state":"idle"},{"e":["21","34"],"state":"idle"},{"e":["33","34"],"state":"idle"},{"e":["22","1"],"state":"tree"},{"e":["22","2"],"state":"tree"},{"e":["1","2"],"state":"tree"},{"panel":"r","list":[{"key":"22"},{"key":"1"},{"key":"2"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"23"},{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"]]}]},{"say":"Start from 23, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 33 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 23, 33 and 34. Record them as maximal clique 8.","ops":[{"v":"1","state":"idle"},{"v":"2","state":"idle"},{"v":"22","state":"idle"},{"v":"23","state":"current"},{"v":"33","state":"current"},{"v":"34","state":"current"},{"e":["22","1"],"state":"idle"},{"e":["22","2"],"state":"idle"},{"e":["1","2"],"state":"idle"},{"e":["23","33"],"state":"tree"},{"e":["23","34"],"state":"tree"},{"e":["33","34"],"state":"tree"},{"panel":"r","list":[{"key":"23"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"10"},{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"]]}]},{"say":"Start from 10, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 3 to R. P and X are both empty, so no other vertex is adjacent to both 10 and 3. Record them as maximal clique 9.","ops":[{"v":"3","state":"current"},{"v":"10","state":"current"},{"v":"23","state":"idle"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["23","33"],"state":"idle"},{"e":["23","34"],"state":"idle"},{"e":["33","34"],"state":"idle"},{"e":["10","3"],"state":"tree"},{"panel":"r","list":[{"key":"10"},{"key":"3"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"13"},{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"]]}]},{"say":"Back up until R holds only 10, then add 34. P and X are both empty, so no other vertex is adjacent to both 10 and 34. Record them as maximal clique 10.","ops":[{"v":"3","state":"idle"},{"v":"34","state":"current"},{"e":["10","3"],"state":"idle"},{"e":["10","34"],"state":"tree"},{"panel":"r","list":[{"key":"10"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"]]}]},{"say":"Start from 13, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 4 to R. P and X are both empty, so no other vertex is adjacent to all of 13, 1 and 4. Record them as maximal clique 11.","ops":[{"v":"1","state":"current"},{"v":"4","state":"current"},{"v":"10","state":"idle"},{"v":"13","state":"current"},{"v":"34","state":"idle"},{"e":["10","34"],"state":"idle"},{"e":["13","1"],"state":"tree"},{"e":["13","4"],"state":"tree"},{"e":["1","4"],"state":"tree"},{"panel":"r","list":[{"key":"13"},{"key":"1"},{"key":"4"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"27"},{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"]]}]},{"say":"Start from 27, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 30 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 27, 30 and 34. Record them as maximal clique 12.","ops":[{"v":"1","state":"idle"},{"v":"4","state":"idle"},{"v":"13","state":"idle"},{"v":"27","state":"current"},{"v":"30","state":"current"},{"v":"34","state":"current"},{"e":["13","1"],"state":"idle"},{"e":["13","4"],"state":"idle"},{"e":["1","4"],"state":"idle"},{"e":["27","30"],"state":"tree"},{"e":["27","34"],"state":"tree"},{"e":["30","34"],"state":"tree"},{"panel":"r","list":[{"key":"27"},{"key":"30"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"15"},{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"]]}]},{"say":"Start from 15, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 33 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 15, 33 and 34. Record them as maximal clique 13.","ops":[{"v":"15","state":"current"},{"v":"27","state":"idle"},{"v":"30","state":"idle"},{"v":"33","state":"current"},{"e":["27","30"],"state":"idle"},{"e":["27","34"],"state":"idle"},{"e":["30","34"],"state":"idle"},{"e":["15","33"],"state":"tree"},{"e":["15","34"],"state":"tree"},{"e":["33","34"],"state":"tree"},{"panel":"r","list":[{"key":"15"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"5"},{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"]]}]},{"say":"Start from 5, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 7 to R. P and X are both empty, so no other vertex is adjacent to all of 5, 1 and 7. Record them as maximal clique 14.","ops":[{"v":"1","state":"current"},{"v":"5","state":"current"},{"v":"7","state":"current"},{"v":"15","state":"idle"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["15","33"],"state":"idle"},{"e":["15","34"],"state":"idle"},{"e":["33","34"],"state":"idle"},{"e":["5","1"],"state":"tree"},{"e":["5","7"],"state":"tree"},{"e":["1","7"],"state":"tree"},{"panel":"r","list":[{"key":"5"},{"key":"1"},{"key":"7"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"7"},{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"]]}]},{"say":"Back up until R holds only 5 and 1, then add 11. P and X are both empty, so no other vertex is adjacent to all of 5, 1 and 11. Record them as maximal clique 15.","ops":[{"v":"7","state":"idle"},{"v":"11","state":"current"},{"e":["5","7"],"state":"idle"},{"e":["1","7"],"state":"idle"},{"e":["5","11"],"state":"tree"},{"e":["1","11"],"state":"tree"},{"panel":"r","list":[{"key":"5"},{"key":"1"},{"key":"11"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"]]}]},{"say":"Start from 7, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 6 to R. P and X are both empty, so no other vertex is adjacent to all of 7, 1 and 6. Record them as maximal clique 16.","ops":[{"v":"5","state":"idle"},{"v":"6","state":"current"},{"v":"7","state":"current"},{"v":"11","state":"idle"},{"e":["5","1"],"state":"idle"},{"e":["5","11"],"state":"idle"},{"e":["1","11"],"state":"idle"},{"e":["7","1"],"state":"tree"},{"e":["7","6"],"state":"tree"},{"e":["1","6"],"state":"tree"},{"panel":"r","list":[{"key":"7"},{"key":"1"},{"key":"6"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"11"},{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"]]}]},{"say":"Start from 11, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 6 to R. P and X are both empty, so no other vertex is adjacent to all of 11, 1 and 6. Record them as maximal clique 17.","ops":[{"v":"7","state":"idle"},{"v":"11","state":"current"},{"e":["7","1"],"state":"idle"},{"e":["7","6"],"state":"idle"},{"e":["11","1"],"state":"tree"},{"e":["11","6"],"state":"tree"},{"panel":"r","list":[{"key":"11"},{"key":"1"},{"key":"6"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"6"},{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"]]}]},{"say":"Start from 6, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. The pivot, 7, is in X and adjacent to every vertex in R and P, so every clique grown from here could also take 7. Those cliques were listed already. Back up.","ops":[{"v":"1","state":"waiting"},{"v":"7","state":"done"},{"v":"11","state":"done"},{"v":"17","state":"done"},{"e":["11","1"],"state":"idle"},{"e":["11","6"],"state":"idle"},{"e":["1","6"],"state":"idle"},{"panel":"r","list":[{"key":"6"}]},{"panel":"p","list":[{"key":"1"}]},{"panel":"x","list":[{"key":"7"},{"key":"11"},{"key":"17"}]},{"panel":"starts","list":[{"key":"20"},{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"Start from 20, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 and 2 to R. P and X are both empty, so no other vertex is adjacent to all of 20, 1 and 2. Record them as maximal clique 18.","ops":[{"v":"1","state":"current"},{"v":"2","state":"current"},{"v":"6","state":"idle"},{"v":"7","state":"idle"},{"v":"11","state":"idle"},{"v":"17","state":"idle"},{"v":"20","state":"current"},{"e":["20","1"],"state":"tree"},{"e":["20","2"],"state":"tree"},{"e":["1","2"],"state":"tree"},{"panel":"r","list":[{"key":"20"},{"key":"1"},{"key":"2"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"30"},{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"]]}]},{"say":"Back up until R holds only 20, then add 34. P and X are both empty, so no other vertex is adjacent to both 20 and 34. Record them as maximal clique 19.","ops":[{"v":"1","state":"idle"},{"v":"2","state":"idle"},{"v":"34","state":"current"},{"e":["20","1"],"state":"idle"},{"e":["20","2"],"state":"idle"},{"e":["1","2"],"state":"idle"},{"e":["20","34"],"state":"tree"},{"panel":"r","list":[{"key":"20"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"]]}]},{"say":"Start from 30, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 24, 33 and 34 to R. P and X are both empty, so no other vertex is adjacent to all of 30, 24, 33 and 34. Record them as maximal clique 20.","ops":[{"v":"20","state":"idle"},{"v":"24","state":"current"},{"v":"30","state":"current"},{"v":"33","state":"current"},{"e":["20","34"],"state":"idle"},{"e":["30","24"],"state":"tree"},{"e":["30","33"],"state":"tree"},{"e":["30","34"],"state":"tree"},{"e":["24","33"],"state":"tree"},{"e":["24","34"],"state":"tree"},{"e":["33","34"],"state":"tree"},{"panel":"r","list":[{"key":"30"},{"key":"24"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"25"},{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"]]}]},{"say":"Start from 25, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 26 and 32 to R. P and X are both empty, so no other vertex is adjacent to all of 25, 26 and 32. Record them as maximal clique 21.","ops":[{"v":"24","state":"idle"},{"v":"25","state":"current"},{"v":"26","state":"current"},{"v":"30","state":"idle"},{"v":"32","state":"current"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["30","24"],"state":"idle"},{"e":["30","33"],"state":"idle"},{"e":["30","34"],"state":"idle"},{"e":["24","33"],"state":"idle"},{"e":["24","34"],"state":"idle"},{"e":["33","34"],"state":"idle"},{"e":["25","26"],"state":"tree"},{"e":["25","32"],"state":"tree"},{"e":["26","32"],"state":"tree"},{"panel":"r","list":[{"key":"25"},{"key":"26"},{"key":"32"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"26"},{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"]]}]},{"say":"Back up until R holds only 25, then add 28. P and X are both empty, so no other vertex is adjacent to both 25 and 28. Record them as maximal clique 22.","ops":[{"v":"26","state":"idle"},{"v":"28","state":"current"},{"v":"32","state":"idle"},{"e":["25","26"],"state":"idle"},{"e":["25","32"],"state":"idle"},{"e":["26","32"],"state":"idle"},{"e":["25","28"],"state":"tree"},{"panel":"r","list":[{"key":"25"},{"key":"28"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"]]}]},{"say":"Start from 26, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 24 to R. P and X are both empty, so no other vertex is adjacent to both 26 and 24. Record them as maximal clique 23.","ops":[{"v":"24","state":"current"},{"v":"25","state":"idle"},{"v":"26","state":"current"},{"v":"28","state":"idle"},{"e":["25","28"],"state":"idle"},{"e":["26","24"],"state":"tree"},{"panel":"r","list":[{"key":"26"},{"key":"24"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"29"},{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"]]}]},{"say":"Start from 29, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 3 to R. P and X are both empty, so no other vertex is adjacent to both 29 and 3. Record them as maximal clique 24.","ops":[{"v":"3","state":"current"},{"v":"24","state":"idle"},{"v":"26","state":"idle"},{"v":"29","state":"current"},{"e":["26","24"],"state":"idle"},{"e":["29","3"],"state":"tree"},{"panel":"r","list":[{"key":"29"},{"key":"3"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"28"},{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"]]}]},{"say":"Back up until R holds only 29, then add 32 and 34. P and X are both empty, so no other vertex is adjacent to all of 29, 32 and 34. Record them as maximal clique 25.","ops":[{"v":"3","state":"idle"},{"v":"32","state":"current"},{"v":"34","state":"current"},{"e":["29","3"],"state":"idle"},{"e":["29","32"],"state":"tree"},{"e":["29","34"],"state":"tree"},{"e":["32","34"],"state":"tree"},{"panel":"r","list":[{"key":"29"},{"key":"32"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"]]}]},{"say":"Start from 28, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 3 to R. P and X are both empty, so no other vertex is adjacent to both 28 and 3. Record them as maximal clique 26.","ops":[{"v":"3","state":"current"},{"v":"28","state":"current"},{"v":"29","state":"idle"},{"v":"32","state":"idle"},{"v":"34","state":"idle"},{"e":["29","32"],"state":"idle"},{"e":["29","34"],"state":"idle"},{"e":["32","34"],"state":"idle"},{"e":["28","3"],"state":"tree"},{"panel":"r","list":[{"key":"28"},{"key":"3"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"24"},{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"]]}]},{"say":"Back up until R holds only 28, then add 24 and 34. P and X are both empty, so no other vertex is adjacent to all of 28, 24 and 34. Record them as maximal clique 27.","ops":[{"v":"3","state":"idle"},{"v":"24","state":"current"},{"v":"34","state":"current"},{"e":["28","3"],"state":"idle"},{"e":["28","24"],"state":"tree"},{"e":["28","34"],"state":"tree"},{"e":["24","34"],"state":"tree"},{"panel":"r","list":[{"key":"28"},{"key":"24"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"]]}]},{"say":"Start from 24, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. The pivot, 30, is in X and adjacent to every vertex in R and P, so every clique grown from here could also take 30. Those cliques were listed already. Back up.","ops":[{"v":"26","state":"done"},{"v":"28","state":"done"},{"v":"30","state":"done"},{"v":"33","state":"waiting"},{"v":"34","state":"waiting"},{"e":["28","24"],"state":"idle"},{"e":["28","34"],"state":"idle"},{"e":["24","34"],"state":"idle"},{"panel":"r","list":[{"key":"24"}]},{"panel":"p","list":[{"key":"33"},{"key":"34"}]},{"panel":"x","list":[{"key":"26"},{"key":"28"},{"key":"30"}]},{"panel":"starts","list":[{"key":"32"},{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]}]},{"say":"Start from 32, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1 to R. P and X are both empty, so no other vertex is adjacent to both 32 and 1. Record them as maximal clique 28.","ops":[{"v":"1","state":"current"},{"v":"24","state":"idle"},{"v":"26","state":"idle"},{"v":"28","state":"idle"},{"v":"30","state":"idle"},{"v":"32","state":"current"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["32","1"],"state":"tree"},{"panel":"r","list":[{"key":"32"},{"key":"1"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"8"},{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"]]}]},{"say":"Back up until R holds only 32, then add 33 and 34. P and X are both empty, so no other vertex is adjacent to all of 32, 33 and 34. Record them as maximal clique 29.","ops":[{"v":"1","state":"idle"},{"v":"33","state":"current"},{"v":"34","state":"current"},{"e":["32","1"],"state":"idle"},{"e":["32","33"],"state":"tree"},{"e":["32","34"],"state":"tree"},{"e":["33","34"],"state":"tree"},{"panel":"r","list":[{"key":"32"},{"key":"33"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"]]}]},{"say":"Start from 8, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1, 2, 3 and 4 to R. P and X are both empty, so no other vertex is adjacent to all of 8, 1, 2, 3 and 4. Record them as maximal clique 30.","ops":[{"v":"1","state":"current"},{"v":"2","state":"current"},{"v":"3","state":"current"},{"v":"4","state":"current"},{"v":"8","state":"current"},{"v":"32","state":"idle"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"e":["32","33"],"state":"idle"},{"e":["32","34"],"state":"idle"},{"e":["33","34"],"state":"idle"},{"e":["8","1"],"state":"tree"},{"e":["8","2"],"state":"tree"},{"e":["8","3"],"state":"tree"},{"e":["8","4"],"state":"tree"},{"e":["1","2"],"state":"tree"},{"e":["1","3"],"state":"tree"},{"e":["1","4"],"state":"tree"},{"e":["2","3"],"state":"tree"},{"e":["2","4"],"state":"tree"},{"e":["3","4"],"state":"tree"},{"panel":"r","list":[{"key":"8"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"4"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"4"},{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"]]}]},{"say":"Start from 4, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 1, 2, 3 and 14 to R. P and X are both empty, so no other vertex is adjacent to all of 4, 1, 2, 3 and 14. Record them as maximal clique 31.","ops":[{"v":"8","state":"idle"},{"v":"14","state":"current"},{"e":["8","1"],"state":"idle"},{"e":["8","2"],"state":"idle"},{"e":["8","3"],"state":"idle"},{"e":["8","4"],"state":"idle"},{"e":["1","4"],"state":"idle"},{"e":["2","4"],"state":"idle"},{"e":["3","4"],"state":"idle"},{"e":["4","1"],"state":"tree"},{"e":["4","2"],"state":"tree"},{"e":["4","3"],"state":"tree"},{"e":["4","14"],"state":"tree"},{"e":["1","14"],"state":"tree"},{"e":["2","14"],"state":"tree"},{"e":["3","14"],"state":"tree"},{"panel":"r","list":[{"key":"4"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"14"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"14"},{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"],["4","1","2","3","14"]]}]},{"say":"Start from 14, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 34 to R. P and X are both empty, so no other vertex is adjacent to both 14 and 34. Record them as maximal clique 32.","ops":[{"v":"1","state":"idle"},{"v":"2","state":"idle"},{"v":"3","state":"idle"},{"v":"4","state":"idle"},{"v":"34","state":"current"},{"e":["4","1"],"state":"idle"},{"e":["4","2"],"state":"idle"},{"e":["4","3"],"state":"idle"},{"e":["4","14"],"state":"idle"},{"e":["1","2"],"state":"idle"},{"e":["1","3"],"state":"idle"},{"e":["1","14"],"state":"idle"},{"e":["2","3"],"state":"idle"},{"e":["2","14"],"state":"idle"},{"e":["3","14"],"state":"idle"},{"e":["14","34"],"state":"tree"},{"panel":"r","list":[{"key":"14"},{"key":"34"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"1"},{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"],["4","1","2","3","14"],["14","34"]]}]},{"say":"Start from 1, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 3 and 9 to R. P and X are both empty, so no other vertex is adjacent to all of 1, 3 and 9. Record them as maximal clique 33.","ops":[{"v":"1","state":"current"},{"v":"3","state":"current"},{"v":"9","state":"current"},{"v":"14","state":"idle"},{"v":"34","state":"idle"},{"e":["14","34"],"state":"idle"},{"e":["1","3"],"state":"tree"},{"e":["1","9"],"state":"tree"},{"e":["3","9"],"state":"tree"},{"panel":"r","list":[{"key":"1"},{"key":"3"},{"key":"9"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"2"},{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"],["4","1","2","3","14"],["14","34"],["1","3","9"]]}]},{"say":"Start from 2, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 31 to R. P and X are both empty, so no other vertex is adjacent to both 2 and 31. Record them as maximal clique 34.","ops":[{"v":"1","state":"idle"},{"v":"2","state":"current"},{"v":"3","state":"idle"},{"v":"9","state":"idle"},{"v":"31","state":"current"},{"e":["1","3"],"state":"idle"},{"e":["1","9"],"state":"idle"},{"e":["3","9"],"state":"idle"},{"e":["2","31"],"state":"tree"},{"panel":"r","list":[{"key":"2"},{"key":"31"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"3"},{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"],["4","1","2","3","14"],["14","34"],["1","3","9"],["2","31"]]}]},{"say":"Start from 3, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 33 and 9 to R. P and X are both empty, so no other vertex is adjacent to all of 3, 33 and 9. Record them as maximal clique 35.","ops":[{"v":"2","state":"idle"},{"v":"3","state":"current"},{"v":"9","state":"current"},{"v":"31","state":"idle"},{"v":"33","state":"current"},{"e":["2","31"],"state":"idle"},{"e":["3","33"],"state":"tree"},{"e":["3","9"],"state":"tree"},{"e":["33","9"],"state":"tree"},{"panel":"r","list":[{"key":"3"},{"key":"33"},{"key":"9"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"],["4","1","2","3","14"],["14","34"],["1","3","9"],["2","31"],["3","33","9"]]}]},{"say":"Start from 34, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. Add 9, 31 and 33 to R. P and X are both empty, so no other vertex is adjacent to all of 34, 9, 31 and 33. Record them as maximal clique 36.","ops":[{"v":"3","state":"idle"},{"v":"31","state":"current"},{"v":"34","state":"current"},{"e":["3","33"],"state":"idle"},{"e":["3","9"],"state":"idle"},{"e":["33","9"],"state":"idle"},{"e":["34","9"],"state":"tree"},{"e":["34","31"],"state":"tree"},{"e":["34","33"],"state":"tree"},{"e":["9","31"],"state":"tree"},{"e":["9","33"],"state":"tree"},{"e":["31","33"],"state":"tree"},{"panel":"r","list":[{"key":"34"},{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"p","list":[]},{"panel":"x","list":[]},{"panel":"starts","list":[{"key":"9"},{"key":"31"},{"key":"33"}]},{"panel":"cliques","groups":[["12","1"],["16","33","34"],["17","6","7"],["18","1","2"],["19","33","34"],["21","33","34"],["22","1","2"],["23","33","34"],["10","3"],["10","34"],["13","1","4"],["27","30","34"],["15","33","34"],["5","1","7"],["5","1","11"],["7","1","6"],["11","1","6"],["20","1","2"],["20","34"],["30","24","33","34"],["25","26","32"],["25","28"],["26","24"],["29","3"],["29","32","34"],["28","3"],["28","24","34"],["32","1"],["32","33","34"],["8","1","2","3","4"],["4","1","2","3","14"],["14","34"],["1","3","9"],["2","31"],["3","33","9"],["34","9","31","33"]]}]},{"say":"Start from 9, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. The pivot, 34, is in X and adjacent to every vertex in R and P, so every clique grown from here could also take 34. Those cliques were listed already. Back up.","ops":[{"v":"1","state":"done"},{"v":"3","state":"done"},{"v":"31","state":"waiting"},{"v":"33","state":"waiting"},{"v":"34","state":"done"},{"e":["34","9"],"state":"idle"},{"e":["34","31"],"state":"idle"},{"e":["34","33"],"state":"idle"},{"e":["9","31"],"state":"idle"},{"e":["9","33"],"state":"idle"},{"e":["31","33"],"state":"idle"},{"panel":"r","list":[{"key":"9"}]},{"panel":"p","list":[{"key":"31"},{"key":"33"}]},{"panel":"x","list":[{"key":"1"},{"key":"3"},{"key":"34"}]},{"panel":"starts","list":[{"key":"31"},{"key":"33"}]}]},{"say":"Start from 31, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. The pivot, 9, is in X and adjacent to every vertex in R and P, so every clique grown from here could also take 9. Those cliques were listed already. Back up.","ops":[{"v":"1","state":"idle"},{"v":"2","state":"done"},{"v":"3","state":"idle"},{"v":"9","state":"done"},{"v":"31","state":"current"},{"panel":"r","list":[{"key":"31"}]},{"panel":"p","list":[{"key":"33"}]},{"panel":"x","list":[{"key":"2"},{"key":"9"},{"key":"34"}]},{"panel":"starts","list":[{"key":"33"}]}]},{"say":"Start from 33, the next vertex in degeneracy order, with its later neighbors in P and its earlier ones in X. P is empty, but all 12 vertices in X are adjacent to 33, so R is not a maximal clique. The cliques that extend it were listed already. Back up.","ops":[{"v":"2","state":"idle"},{"v":"3","state":"done"},{"v":"15","state":"done"},{"v":"16","state":"done"},{"v":"19","state":"done"},{"v":"21","state":"done"},{"v":"23","state":"done"},{"v":"24","state":"done"},{"v":"30","state":"done"},{"v":"31","state":"done"},{"v":"32","state":"done"},{"v":"33","state":"current"},{"panel":"r","list":[{"key":"33"}]},{"panel":"p","list":[]},{"panel":"x","list":[{"key":"3"},{"key":"9"},{"key":"15"},{"key":"16"},{"key":"19"},{"key":"21"},{"key":"23"},{"key":"24"},{"key":"30"},{"key":"31"},{"key":"32"},{"key":"34"}]},{"panel":"starts","list":[]}]},{"say":"Done. Every vertex has been a start, and the search found 36 maximal cliques. The biggest has 5 vertices.","ops":[{"v":"3","state":"idle"},{"v":"9","state":"idle"},{"v":"15","state":"idle"},{"v":"16","state":"idle"},{"v":"19","state":"idle"},{"v":"21","state":"idle"},{"v":"23","state":"idle"},{"v":"24","state":"idle"},{"v":"30","state":"idle"},{"v":"31","state":"idle"},{"v":"32","state":"idle"},{"v":"33","state":"idle"},{"v":"34","state":"idle"},{"panel":"r","list":[]},{"panel":"p","list":[]},{"panel":"x","list":[]}]}],"traceNote":"","verification":"The steps come from a step-by-step copy of the algorithm. Its result is checked against gograph's on every start.","snippet":"for _, clique := range partition.MaximalCliques(g) {\n\tvar names []string\n\tfor _, v := range clique {\n\t\tnames = append(names, v.Label())\n\t}\n\tfmt.Println(strings.Join(names, \", \"))\n}"}
