<｜begin▁of▁sentence｜>### Instruction:
Given a graph with an edge set [(0, 1), (1, 2), (0, 2), (2, 3), (3, 4)], how can you generate all simple paths from node 0 to node 4 using NetworkX?
### Response:
import networkx as nx

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

# Generate all simple paths from node 0 to node 4
paths = list(nx.all_simple_paths(G, source=0, target=4))
print('All simple paths from 0 to 4:', paths)
<|EOT|>
