<｜begin▁of▁sentence｜>### Instruction:
Given a large graph in 'large_graph.gml' and a smaller graph in 'subgraph.gml', how can you find all mappings of the smaller graph onto the larger graph using the LAD algorithm in igraph?
### Response:
from igraph import Graph

# Assume G is the larger graph and H is the subgraph we are checking for
G = Graph.Read('large_graph.gml')
H = Graph.Read('subgraph.gml')

# Find all subisomorphisms using the LAD algorithm
subisomorphisms = G.get_subisomorphisms_lad(H)

# Print the mappings of the smaller graph H onto the larger graph G
for i, iso in enumerate(subisomorphisms, 1):
    print(f'Subisomorphism {i}:', iso)
<|EOT|>
