<｜begin▁of▁sentence｜>### Instruction:
Given two graphs G with edges [(0, 1), (0, 2), (1, 2), (1, 3)] and H with edges [(0, 1), (1, 2), (0, 3)], compute the difference between G and H, returning a new graph that contains the edges that exist in G but not in H.
### Response:
import networkx as nx

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

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

# Compute the difference between G and H
R = nx.difference(G, H)

print('Nodes in R:', list(R.nodes))
print('Edges in R:', list(R.edges))
<|EOT|>
