Greedy vertex coloringSource:
greedy_vertex_coloring() finds a coloring for the vertices of a graph
based on a simple greedy algorithm.
greedy_vertex_coloring(graph, heuristic = c("colored_neighbors", "dsatur"))
The graph object to color
The selection heuristic for the next vertex to consider. Currently only one heuristic is supported: “colored_neighbors” selects the vertex with the largest number of already colored neighbors.
The goal of vertex coloring is to assign a "color" (i.e. a positive integer index) to each vertex of the graph such that neighboring vertices never have the same color. This function solves the problem by considering the vertices one by one according to a heuristic, always choosing the smallest color index that differs from that of already colored neighbors. The coloring obtained this way is not necessarily minimal but it can be calculated in linear time.