<｜begin▁of▁sentence｜>### Instruction:
Given two graphs G with edges [(0, 1), (0, 2)] and H with edges [(3, 4)], how can one use NetworkX to create a new graph that represents the full join of G and H, with the nodes of G and H renamed to 'G-' and 'H-' respectively?
### Response:
import networkx as nx

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

# Perform a full join of G and H
R = nx.full_join(G, H, rename=('G-', 'H-'))

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