- class GraphPartition(graph)#
Optimization application for the "graph partition"  problem based on a NetworkX graph.
: "Graph partition", https://en.wikipedia.org/wiki/Graph_partition
Getter of the graph
A graph for a problem
- 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.