pyclustering.gcolor.dsatur.dsatur Class Reference

Represents DSATUR algorithm for graph coloring problem that uses greedy strategy. More...

Public Member Functions
def	__init__ (self, data)
	Constructor of DSATUR algorithm. More...
def	process (self)
	Perform graph coloring using DSATUR algorithm. More...
def	get_colors (self)
	Returns results of graph coloring. More...

Detailed Description

Represents DSATUR algorithm for graph coloring problem that uses greedy strategy.

Definition at line 12 of file dsatur.py.

Constructor & Destructor Documentation

__init__()

def pyclustering.gcolor.dsatur.dsatur.__init__	(		self,
			data
	)

Constructor of DSATUR algorithm.

Parameters

[in]

data

(list): Matrix graph representation.

Definition at line 18 of file dsatur.py.

Member Function Documentation

get_colors()

def pyclustering.gcolor.dsatur.dsatur.get_colors

(

self

)

Returns results of graph coloring.

Returns

(list) list with assigned colors where each element corresponds to node in the graph, for example [1, 2, 2, 1, 3, 4, 1].

See also

process()

Definition at line 110 of file dsatur.py.

process()

def pyclustering.gcolor.dsatur.dsatur.process

(

self

)

Perform graph coloring using DSATUR algorithm.

See also

get_colors()

Definition at line 32 of file dsatur.py.

---

The documentation for this class was generated from the following file:

• pyclustering/gcolor/dsatur.py