Unique First Fit Algorithm Graph Coloring. 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.
Source: www.geeksforgeeks.org
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. For example, consider the following two graphs. 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.
