<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges between vertices (0, 1), (1, 2), (2, 3), (3, 0), and (1, 3), how can you calculate the generators of the automorphism group using the BLISS isomorphism algorithm with the first smallest maximally non-trivially connected non-singleton cell as the splitting heuristic?
### Response:
from igraph import Graph

# Create an undirected graph
g = Graph([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)])

# Calculate the automorphism group
heuristics = 'fsm'  # First smallest maximally non-trivially connected non-singleton cell
automorphisms = g.automorphism_group(sh=heuristics)

# Print the generators of the automorphism group
for automorphism in automorphisms:
    print(automorphism)
<|EOT|>
