[ALGO] Welsh-Powell Algorithm #117
Labels
enhancement
New feature
good first issue
Good for newcomers
hacktoberfest
help wanted
Extra attention is needed
Welsh-Powell Algorithm
The Welsh-Powell algorithm is a greedy graph coloring algorithm. It works by sorting the vertices by their degrees in descending order and then assigning colors in a manner that no two adjacent vertices share the same color. This algorithm is particularly efficient for coloring sparse graphs and is generally simpler to implement than other coloring algorithms.
Since it is a variant of the greedy coloring algorithm (which is already implemented under
algorithm/coloring/greedy_graph_coloring.h
), it would be nice if we could reuse that implementation.More details on this variant of greedy coloring can be found in the wikipedia entry.
Syntax
The algorithm should have the following syntax:
This should live in the
graaf::algorithm
namespace underinclude/graaflib/algorithm/coloring/welsh_powell.h
.Definition of Done
This issue is done when:
test/graaflib/algorithm/coloring/welsh_powell_test.cpp
docs/docs/algorithms
under the appropriate categoryREADME.md
The text was updated successfully, but these errors were encountered: