<｜begin▁of▁sentence｜>### Instruction:
{'data': 'The example code uses a graph with the edge set [(1, 2), (1, 3), (2, 3), (3, 4), (4, 5)].', 'problem': 'The code solves the problem of ordering the nodes in a graph in decreasing order by degree using the largest-first strategy, which is a heuristic for graph coloring.'}
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(1, 2), (1, 3), (2, 3), (3, 4), (4, 5)])

# Use the largest-first strategy
nodes_by_degree = list(nx.coloring.strategy_largest_first(G))

print('Nodes in decreasing order by degree:', nodes_by_degree)
<|EOT|>
