<｜begin▁of▁sentence｜>### Instruction:
Given a complete graph with 5 nodes and a path graph with 3 nodes (0-1-2), can you subtract the path graph from the complete graph in-place, thus modifying the complete graph by removing the nodes and edges that are present in the path graph? After subtraction, print the nodes and edges present in the modified complete graph.
### Response:
import networkx as nx

# Create two graphs
G = nx.complete_graph(5)  # Complete graph with 5 nodes
H = nx.path_graph(3)  # Path graph with 3 nodes (0-1-2)

# In-place subtraction: G will be modified, removing the nodes and edges that are present in H
G -= H

print('Nodes in G after subtraction:', G.nodes())
print('Edges in G after subtraction:', G.edges())
<|EOT|>
