<｜begin▁of▁sentence｜>### Instruction:
Given a cycle graph with 4 nodes, how can the 'saturation largest first' strategy be used to color the graph such that adjacent nodes have different colors using NetworkX?
### Response:
import networkx as nx
from networkx.algorithms.coloring import greedy_color

# Create a graph
G = nx.cycle_graph(4)

# Use the saturation largest first strategy to color the graph
colors = greedy_color(G, strategy=nx.coloring.strategy_saturation_largest_first)

print(colors)
<|EOT|>
