<｜begin▁of▁sentence｜>### Instruction:
Given a graph with an edge set [(1, 2), (2, 3), (3, 4), (4, 5), (5, 1)], can you generate an ordering of the nodes of the graph using the smallest last strategy where degrees of nodes are considered in ascending order?
### Response:
import networkx as nx

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

# Apply smallest last strategy
deque = nx.coloring.strategy_smallest_last(G)

# Convert deque to list for display purposes
ordering = list(deque)
print('Ordering:', ordering)
<|EOT|>
