qlauncher.problems.optimization.graph_coloring

This module contains the Graph Coloring class.

Summary

Classes:

GraphColoring

Class for Graph Coloring Problem which is a combinatorial problem involving assigning labels to vertices of the graph such that no two adjacent vertices share the same label.

Reference

class qlauncher.problems.optimization.graph_coloring.GraphColoring(instance: Graph, num_colors: int, instance_name: str = 'unnamed')

Bases: Problem

Class for Graph Coloring Problem which is a combinatorial problem involving assigning labels to vertices of the graph such that no two adjacent vertices share the same label.

instance

The graph for which the coloring problem is to be solved.

Type:

nx.Graph

property setup: dict

static from_preset(instance_name: Literal['default', 'small'], **kwargs) → GraphColoring

classmethod from_file(path: str) → Problem

visualize(solution: list[int] | None = None) → None

static generate_graph_coloring_instance(num_vertices: int, edge_probability: int, num_colors: int) → GraphColoring

static randomly_choose_a_graph(num_colors: int) → GraphColoring

to_hamiltonian(constraints_weight: float = 1, costs_weight: float = 1) → Hamiltonian

to_bqm() → BQM

Returns BQM

to_qubo() → QUBO