ProblemData

class iqm.applications.graph_utils.ProblemData(graph, orig_to_new_mapping, fixed_vars, bitstring, highlight_edge_by_node_count)

Bases: object

Normalized problem information extracted and validated before plotting.

Attributes

graph	The problem graph to be visualized.
orig_to_new_mapping	Mapping of original variable names to integer node indices.
fixed_vars	Set of variables that were fixed in the optimization problem instance.
bitstring	Bitstring representing highlighted (active) nodes in the solution.
highlight_edge_by_node_count	Rule describing which edges to highlight based on how many connected nodes are highlighted.

Methods

__delattr__(name)	Implement delattr(self, name).
__eq__(other)	Return self==value.
__hash__()	Return hash(self).
__repr__()	Return repr(self).
__setattr__(name, value)	Implement setattr(self, name, value).

Parameters:

• graph (Graph)

• orig_to_new_mapping (Mapping[Any, int])

• fixed_vars (frozenset[int])

• bitstring (str)

• highlight_edge_by_node_count (frozenset[int])

graph: Graph

The problem graph to be visualized.

orig_to_new_mapping: Mapping[Any, int]

Mapping of original variable names to integer node indices.

fixed_vars: frozenset[int]

Set of variables that were fixed in the optimization problem instance.

bitstring: str

Bitstring representing highlighted (active) nodes in the solution.

highlight_edge_by_node_count: frozenset[int]

Rule describing which edges to highlight based on how many connected nodes are highlighted.