Membandingkan Algoritma D’satur Dengan Algoritma Vertex Merge Dalam Pewarna…

This final project discusses an undirected graph vertex coloring. Graph vertex coloring can be done by using the coloring algorithm, including d’satur algorithm and vertex merge algorithms. Of the two algorithm, a more efficient is determined algorithms that generates chromatic number (G) which is the minimum or produce fewer colors. Keywords:graph, graph vertex coloring, d’satur algo…