<｜begin▁of▁sentence｜>### Instruction:
Given two graphs G and H, with edge sets G's edges are [(0, 1), (0, 2), (1, 2), (1, 3)] and H's edges are [(0, 1), (1, 2), (0, 3)], can you use NetworkX to create a new graph that includes edges that are present in either G or H but not in both? Also, what are the nodes and edges in the new graph?
### 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)])

# Use the symmetric_difference function
difference_graph = nx.symmetric_difference(G, H)

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