qlauncher.problems.problem_initialization.maxcut

This module contains the MaxCut class.

Summary

Classes:

MaxCut

Class for MaxCut Problem.

Reference

class qlauncher.problems.problem_initialization.maxcut.MaxCut(instance: Graph, instance_name='unnamed')

Bases: Problem

Class for MaxCut Problem.

This class represents MaxCut Problem which is a combinatorial optimization problem that involves partitioning the vertices of a graph into two sets such that the number of edges between the two sets is maximized. The class contains an instance of the problem, so it can be passed into QLauncher.

instance

The graph instance representing the problem.

Type:

nx.Graph

property setup: dict

static from_preset(instance_name: str) → MaxCut

visualize(bitstring: str | None = None)

static generate_maxcut_instance(num_vertices: int, edge_probability: float) → MaxCut