<｜begin▁of▁sentence｜>### Instruction:
Given a famous graph, such as the Petersen graph, can you calculate its canonical permutation using the BLISS algorithm with the 'fm' splitting heuristic, and then permute the vertices to obtain the canonical form of the graph? Print the edges of the canonical graph.
### Response:
from igraph import Graph

# Create a graph or read from a file
g = Graph.Famous('petersen')

# Calculate the canonical permutation of the graph
canonical_perm = g.canonical_permutation(sh='fm')

# Apply the permutation to the graph to get the canonical form
g.permute_vertices(canonical_perm)

# Print the new edges to show the canonical form
print(g)
<|EOT|>
