<｜begin▁of▁sentence｜>### Instruction:
{'Description': "Given a graph with edge set [(1, 2), (1, 3), (2, 4), (3, 4), (4, 5)], generate a random permutation of the nodes using the 'strategy_random_sequential' API from NetworkX.", 'Data': 'The graph is described by its edge set [(1, 2), (1, 3), (2, 4), (3, 4), (4, 5)].', 'Problem': 'The code snippet demonstrates how to obtain a random sequential ordering of nodes in a graph. This ordering can be used as a strategy input for graph coloring algorithms.'}
### Response:
import networkx as nx
import networkx.algorithms.coloring as coloring

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

# Generate a random permutation of the nodes
random_nodes = coloring.strategy_random_sequential(G, colors=None)

print('Random node permutation:', random_nodes)
<|EOT|>
