<｜begin▁of▁sentence｜>### Instruction:
Consider a graph represented with nodes labeled 1, 2, 3, 4 and edges connecting them as follows: 1-2, 2-4, 1-3, and 3-4. What are all the simple edge paths from node 1 to node 4?
### Response:
import networkx as nx

# Create a Graph
G = nx.Graph()

# Add edges to the graph
G.add_edges_from([(1, 2), (2, 4), (1, 3), (3, 4)])

# Generate all simple edge paths from node 1 to node 4
paths = list(nx.all_simple_edge_paths(G, source=1, target=4))

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