Represents DSATUR algorithm for graph coloring problem that uses greedy strategy.
More...
Represents DSATUR algorithm for graph coloring problem that uses greedy strategy.
Definition at line 27 of file dsatur.py.
◆ __init__()
def pyclustering.gcolor.dsatur.dsatur.__init__ |
( |
|
self, |
|
|
|
data |
|
) |
| |
Constructor of DSATUR algorithm.
- Parameters
-
[in] | data | (list): Matrix graph representation. |
Definition at line 33 of file dsatur.py.
◆ 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 125 of file dsatur.py.
◆ process()
def pyclustering.gcolor.dsatur.dsatur.process |
( |
|
self | ) |
|
The documentation for this class was generated from the following file: