<｜begin▁of▁sentence｜>### Instruction:
Given two graphs G and H, where G has edges (0,1), (0,2), (1,2), (1,3) and H has edges (0,1), (1,2), (0,3), how can we find the edges that are present in G but not in H?
### Response:
import networkx as nx

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

# Calculate the difference between G and H
D = nx.difference(G, H)

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