Unique First Fit Algorithm Graph Coloring. For example, consider the following two graphs. Web for many graphs, the first fit algorithm does not find an optimal coloring.
Source: www.geeksforgeeks.orgLet’s think of graph coloring as a game with two. Note that in graph on right side, vertices 3 and 4 are swapped. The above algorithm doesn’t always use minimum number of colors.
