- class Clique(graph, size=None)#
Optimization application for the "clique"  problem based on a NetworkX graph.
: "Clique (graph theory)", https://en.wikipedia.org/wiki/Clique_(graph_theory)
size (int | None) -- The size of the clique. When it's None, the default, this class makes an optimization model for a maximal clique instead of the specified size of a clique.
Getter of the graph
A graph for a problem
Getter of size
The size of the clique, None when maximal clique
- draw(result=None, pos=None)#
Draw a graph with the result. When the result is None, draw an original graph without colors.
Interpret a result as a list of node indices
- static sample_most_likely(state_vector)#
Compute the most likely binary string from state vector.
Convert a clique problem instance into a
QuadraticProgram. When "size" is None, this makes an optimization model for a maximal clique instead of the specified size of a clique.
QuadraticProgramcreated from the clique problem instance.
- রিটার্ন টাইপ: