GraphPartition¶
- class GraphPartition(graph)[source]¶
Bases:
GraphOptimizationApplication
Optimization application for the "graph partition" [1] problem based on a NetworkX graph.
References
[1]: "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.
Attributes
Getter of the graph
Methods
draw
([result, pos])Draw a graph with the result.
interpret
(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
sample_most_likely
(state_vector)Compute the most likely binary string from state vector.
Convert a graph partition instance into a
QuadraticProgram