Elegant First Fit Algorithm Graph Coloring. The above algorithm doesn’t always use minimum number of colors. For example, consider the following two graphs.
Source: learnprogramo.com
The above algorithm doesn’t always use minimum number of colors. Also, the number of colors used sometime depend on the order in which vertices are processed. Let’s think of graph coloring as a game with two.
The above algorithm doesn’t always use minimum number of colors. If we consider the vertices. Note that in graph on right side, vertices 3 and 4 are swapped.
Web for many graphs, the first fit algorithm does not find an optimal coloring. Let’s think of graph coloring as a game with two.
