Who came across a software implementation of a brute-force algorithm for coloring a graph?

Question

Delphi

It is necessary to implement the graph coloring algorithm in the Delphi environment, which is contained at the link: www.mathros.net.ua/perebornyj-algorytm-dlja-rozfar...
It is not entirely clear that a new adjacency matrix is ​​formed after the merging of vertices. Maybe someone faced with such a task or knows how to implement it, please help.

Answer 1

longclaps thanks for the reply. However, in my opinion, this will not work. Following the algorithm, at the first stage, the construction of a tree of variants is carried out. After that, among the external nodes of the resulting tree, a graph is selected for which the chromatic number is minimal. Next, its coloring is carried out. At the next step, depending on what color the vertex that was formed as a result of the merging takes, we paint two vertices that were the initiators of the merger in the same color. This is where I have a problem.
Thank you all for your help. The author of the site mathros.net.ua solved my problem. Perhaps someone else will come in handy: www.mathros.net.ua/pravylne-rozfarbuvannja-vershyn...