Is there a c ++ (or any other language) library with a portfolio of algorithms for the problem?
There is undoubtedly naive hearttec color algorithms, but I am interested in more interesting algorithms:
- Algorithms mentioned in the algorithm "Precise Algorithm" section
- Approximation algorithms that take advantage of special graph properties such as graphs or a.
- The algorithm that detects a graph.
This past one has special significance for me.
The list I have found so far is but none of them is the above algorithm. Apart from this, the best one and which was implemented at the end of the 90s, so the documents API (no, it is important for the question that what is about this question, but I think I mention it I want to do) is very old in terms of
This is what I see is the spirit, but if you think about them, then it has not reached the promise yet. It appears in the initial stages of development.
Other common graphs are mentioned in libraries. This includes:
-
I should keep in mind that I am using it for many things. In fact, it provides a colorful color implementation color. The code of Culberson (mentioned above) is very high.
The following graph is a list of color codes, I have found (and tested in most cases), but they still have less algorithmic classes in terms of three.
- - The documentation is not in English, sighs.
- - Includes a color algorithm which guarantees a better 5-color or planer graph.
- - A small number of algorithms which have already been applied by the calculations (above) appear to be re-applied.
Maybe you can help yourself.
Comments
Post a Comment