Iterates over all the nodes of G in “saturation order” (also known as “DSATUR”).
G
G is a NetworkX graph. colors is a dictionary mapping nodes of G to colors, for those nodes that have already been colored.
colors