GraphPartition#

class GraphPartition(graph)[ソース]#

ベースクラス: GraphOptimizationApplication

Optimization application for the 「graph partition」 [1] problem based on a NetworkX graph.

参照

パラメータ:: 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

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