<｜begin▁of▁sentence｜>### Instruction:
Given two graphs G and H with node sets [(0,1), (0,2), (1,2), (1,3)] and [(0,1), (1,2), (0,3)], how do you compute the set of edges that are in G but not in H using NetworkX?
### Response:
import networkx as nx

# Create two graphs G and H
G = nx.Graph([(0,1), (0,2), (1,2), (1,3)])
H = nx.Graph([(0,1), (1,2), (0,3)])

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

# Print nodes and edges of the resulting graph
print('Nodes in R:', R.nodes())
print('Edges in R:', R.edges())
<|EOT|>
