Incredible First Fit Algorithm Graph Coloring. If we consider the vertices. Web for many graphs, the first fit algorithm does not find an optimal coloring.
Source: www.slideserve.com
For example, consider the following two graphs. Let’s think of graph coloring as a game with two. 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. Also, the number of colors used sometime depend on the order in which vertices are processed.
