Optimization application for the “max-cut”  problem based on a NetworkX graph.
: “Maximum cut”, https://en.wikipedia.org/wiki/Maximum_cut
List]) – A graph representing a problem. It can be specified directly as a
Graph (NetworkX) –
as an array or list if format suitable to build out a NetworkX graph. (or) –
Get graph solution in Gset format from binary string.
Interpret a result as two lists of node indices
Read graph in Gset format from file.
Convert a Max-cut problem instance into a