<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3)], can you compute the edge disjoint paths between node 0 and node 3 using NetworkX with Edmonds-Karp flow function?
### Response:
import networkx as nx
from networkx.algorithms.flow import edmonds_karp

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

# Compute the edge disjoint paths between nodes 0 and 3
paths = list(nx.edge_disjoint_paths(G, 0, 3, flow_func=edmonds_karp))

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