“…The 300-node p_hat300-1 random graph has maximum known clique size of eight[78]. This figure shows three different 8-node cliques found by the GBS algorithm, which appear highlighted in red.>>> # sort cliques in decreasing size >>> cliques = sorted(cliques, key=len, reverse=True) >>> cliques[:3] # the three largest cliques [[48,53,87,152, 243, 273, 279, 295],[37,78,158, 207, 218, 239, 249, 267],[17,48,106,148, 170, 196, 224, 234]] >>> from strawberryfields.apps import plot >>> p0 = plot.graph(g, cliques[0]) # SeeFig. 7(left) >>> p1 = plot.graph(g, cliques[1]) # SeeFig.…”