- class GraphPartition(graph)[source]¶
Optimization application for the "graph partition"  problem based on a NetworkX graph.
: "Graph partition", https://en.wikipedia.org/wiki/Graph_partition
graph (Graph | ndarray | List) -- A graph representing a problem. It can be specified directly as a NetworkX graph, or as an array or list format suitable to build out a NetworkX graph.
Getter of the graph
Draw a graph with the result.
Interpret a result as a list of node indices
random_graph(num_nodes, num_edges[, seed])
- param num_nodes:
The number of nodes in a graph
Compute the most likely binary string from state vector.
Convert a graph partition instance into a