<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(1, 2), (2, 3), (3, 4), (4, 5)], can you generate all the simple paths from node 1 to node 5? Use NetworkX to find and print all simple edge paths between these two nodes.
### Response:
import networkx as nx

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

# Use all_simple_edge_paths to generate all paths from node 1 to node 5
paths = list(nx.all_simple_edge_paths(G, 1, 5))

# Print all paths
for path in paths:
    print(path)
<|EOT|>
