Add the DSatur graph coloring algorithm as a new heuristic option for the igraph vertex coloring greedy()…
Add the DSatur graph coloring algorithm as a new heuristic option for the igraph vertex coloring greedy()…: a task in LegoFlow-SWE (Harbor dataset). The task is to add a new enum value IGRAPH COLORING GREEDY DSATUR that can be passed as the heuristic parameter to igraph vertex coloring greedy() …
The task
The task is to add a new enum value `IGRAPH_COLORING_GREEDY_DSATUR` that can be passed as the `heuristic` parameter to `igraph_vertex_coloring_greedy()`. When this heuristic is requested, the implementation must follow the DSatur selection rule described above.
Part of Lego-X/LegoFlow-SWE.