Free First Fit Algorithm Graph Coloring. If we consider the vertices. The above algorithm doesn’t always use minimum number of colors.
Source: dotclu.blogspot.com
For example, consider the following two graphs. Note that in graph on right side, vertices 3 and 4 are swapped. Let’s think of graph coloring as a game with two.
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. 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. If we consider the vertices.
