Anyone firmilar with this graph coloring algorithm, I need to write a c++ program for it; unsure how to start.

A coloring of a graph is an ignment of colors to the vertices of the graph such that no two adjacent vertices share the same color. Suppose that the palette of colors is the set of positive integers. Give an effcient algorithm that colors a given graph G using at most maxdegree(G) + 1 colors, where maxdegree(G) is the maximum degree of any node in G.