## Brexit Clique Finding Code (Cell 2)

### Start of Cell 2 # DISCLAIMER: 1QBit offers no warranty as to the correctness of this software # or its suitability for any purpose. It is offered “as is” for the purpose of # studying how graphs and subgraphs can be calculated from an adjacency matrix # based on publicly-available trade reports. 

 # Calling PolyKPlexAgent with argument k=0 gets the maximal clique # Setting the solver to None allows the SDK to choose the solver based on the graph properties iGraph=0 g=gList[iGraph] kp_agent = PolyKPlexAgent(0) kp_agent.solver = None kp_agent.run(g) mySolutions = kp_agent.get_feasible_solutions().solutions subg=(mySolutions[0]).graph.nodes() 

nx.draw( g, pos=circularPositionDict, labels=nodeLabels, nodelist=g.nodes(), node_color=['y' if i in subg else 'w' for i in g.nodes()], linewidths=0, alpha=0.5 ) plt.show() ### End of Cell 2