<｜begin▁of▁sentence｜>### Instruction:
Given a cycle graph of 4 nodes, how would you apply a greedy coloring algorithm to color the nodes, such that no two adjacent nodes have the same color, using the largest_first strategy as provided by the NetworkX 'greedy_color' function?
### Response:
import networkx as nx

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

# Apply the greedy coloring algorithm using the largest_first strategy
coloring = nx.coloring.greedy_color(G, strategy='largest_first')

# Print the resulting coloring
color_dict = {f'Node {node}': f'Color {color}' for node, color in coloring.items()}
print(color_dict)
<|EOT|>
