<｜begin▁of▁sentence｜>### Instruction:
Given a larger graph G1 with edges [(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)] and a smaller graph G2 with edges [(0, 1), (1, 2), (2, 0)], how can you find all the ways that G2 can map onto G1 as a subgraph?
### Response:
import igraph as ig

# Assuming G1 is the larger graph and G2 is the smaller graph
G1 = ig.Graph([(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)])
G2 = ig.Graph([(0, 1), (1, 2), (2, 0)])

# Find all subisomorphisms from G2 to G1
subisomorphisms = G1.get_subisomorphisms_vf2(G2)

# Print the mappings from G2 to G1
for mapping in subisomorphisms:
    print(mapping)
<|EOT|>
