warp.utils.GraphColoringAlgorithm

class warp.utils.GraphColoringAlgorithm(*values)

Graph coloring algorithm selection.

__init__(*args, **kwds)

Methods

conjugate	Returns self, the complex conjugate of any int.
bit_length()	Number of bits necessary to represent self in binary.
bit_count()	Number of ones in the binary representation of the absolute value of self.
to_bytes([length, byteorder, signed])	Return an array of bytes representing an integer.
from_bytes(bytes[, byteorder, signed])
as_integer_ratio()	Return a pair of integers, whose ratio is equal to the original int.
is_integer()	Returns True.
__init__(*args, **kwds)

Attributes

real	the real part of a complex number
imag	the imaginary part of a complex number
numerator	the numerator of a rational number in lowest terms
denominator	the denominator of a rational number in lowest terms
MCS	Maximum Cardinality Search based coloring algorithm.
GREEDY	Degree-ordered greedy coloring algorithm.

MCS = 0

Maximum Cardinality Search based coloring algorithm.

GREEDY = 1

Degree-ordered greedy coloring algorithm.