Cool First Fit Algorithm Graph Coloring. Also, the number of colors used sometime depend on the order in which vertices are processed. Note that in graph on right side, vertices 3 and 4 are swapped.
Source: www.geeksforgeeks.org
If we consider the vertices. For example, consider the following two graphs. Note that in graph on right side, vertices 3 and 4 are swapped.
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. For example, consider the following two graphs.
If we consider the vertices. Also, the number of colors used sometime depend on the order in which vertices are processed.
