<｜begin▁of▁sentence｜>### Instruction:
{'description': 'Given a graph whose edge set is [(1, 2), (3, 4), (2, 5), (5, 1), (4, 2)], can you generate a sequence of the nodes in the order they are visited using a breadth-first traversal with the strategy_connected_sequential_bfs function from NetworkX?', 'data': 'The edge set of the graph: [(1, 2), (3, 4), (2, 5), (5, 1), (4, 2)].', 'problem': 'The problem is to find a BFS traversal order of the nodes in a graph where for each node except the first, at least one neighbor appeared earlier in the sequence.'}
### Response:
import networkx as nx

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

# Apply BFS strategy
bfs_order = list(nx.strategy_connected_sequential_bfs(G))

print('BFS traversal order:', bfs_order)
<|EOT|>
