# networkx.algorithms.coloring.strategy_saturation_largest_first¶

strategy_saturation_largest_first(G, colors)[source]

Iterates over all the nodes of G in “saturation order” (also known as “DSATUR”).

G is a NetworkX graph. colors is a dictionary mapping nodes of G to colors, for those nodes that have already been colored.