<｜begin▁of▁sentence｜>### Instruction:
Given a simple undirected graph specified by its edge list [(0, 1), (1, 2), (2, 3), (3, 0), (0, 2)], can you use the 'automorphism_group' function in igraph to calculate the generators of the automorphism group of the graph?
### Response:
import igraph as ig

# Assuming we have a Graph object 'g'
g = ig.Graph(edges=[(0, 1), (1, 2), (2, 3), (3, 0), (0, 2)])

# Get the generators of the automorphism group of the graph
aut_group_generators = g.automorphism_group()

# To use and inspect the generators (which are returned as a list of igraph Permutation objects), you can do as follows:
for perm in aut_group_generators:
    print(perm)

# Since Permutation objects are not directly human-readable, you may want to convert them into lists:
perm_lists = [list(perm) for perm in aut_group_generators]
print(perm_lists)
<|EOT|>
