- class Maxcut(graph)#
Optimization application for the "max-cut"  problem based on a NetworkX graph.
: "Maximum cut", https://en.wikipedia.org/wiki/Maximum_cut
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.
- static get_gset_result(x)#
Get graph solution in Gset format from binary string.
Interpret a result as two lists of node indices
- static parse_gset_format(filename)#
Read graph in Gset format from file.
- static sample_most_likely(state_vector)#
Compute the most likely binary string from state vector.