<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'E')], can you generate a list of nodes in the order they are visited using breadth-first search (BFS) traversal starting from node 'A'?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'E')])

# Generate nodes in a specified order
ordered_nodes = list(nx.strategy_connected_sequential(G, traversal='bfs'))
print('Ordered nodes:', ordered_nodes)
<|EOT|>
