Color greedily all nodes, highest number of colored neighbors, then
highest degree. This is slower than colorLF as we must dynamically
recalculate which node to color next among all remaining ones but
produces better results.

Color greedily all nodes, highest saturation, then highest degree.
This is slower than colorLF as we must dynamically recalculate
which node to color next among all remaining ones but produces better
results.