GraphPartition

class GraphPartition(graph)

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

graph

Getter of the graph

রিটার্নস:

A graph for a problem

Methods

draw(result=None, pos=None)

Draw a graph with the result. When the result is None, draw an original graph without colors.

প্যারামিটার:

• result (OptimizationResult | ndarray | None) -- The calculated result for the problem

• pos (Dict[int, ndarray] | None) -- The positions of nodes

interpret(result)

Interpret a result as a list of node indices

প্যারামিটার:

result (OptimizationResult | ndarray) -- The calculated result of the problem

রিটার্নস:

A list of node indices divided into two groups.

রিটার্ন টাইপ:

List[List[int]]

static sample_most_likely(state_vector)

Compute the most likely binary string from state vector.

প্যারামিটার:

state_vector (QuasiDistribution | Statevector | ndarray | Dict) -- state vector or counts or quasi-probabilities.

রিটার্নস:

binary string as numpy.ndarray of ints.

রেইজেস:

ValueError -- if state_vector is not QuasiDistribution, Statevector, np.ndarray, or dict.

রিটার্ন টাইপ:

ndarray

to_quadratic_program()

Convert a graph partition instance into a QuadraticProgram

রিটার্নস:

The QuadraticProgram created from the graph partition instance.

রিটার্ন টাইপ:

QuadraticProgram