Optimization application for the “graph partition”  problem based on a NetworkX graph.
: “Graph partition”, https://en.wikipedia.org/wiki/Graph_partition
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) –
Interpret a result as a list of node indices
Convert a graph partition instance into a