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