For a given weighted graph, this algorithm finds a partition of the graph so that the sum of edge weights between these partitions is maximal. The graph can be specified in the Graph Modeling Language and edge weights can be specified with the weight properties. If the weight property is omitted, a weight of1 units is used implicitly. All solvers will return a graph (in the GML format) with the same node ids, where each node has a partition value assigned. Example MaxCut problems can be found here.