<｜begin▁of▁sentence｜>### Instruction:
As a speech-language pathologist, you might encounter a scenario where you need to compare the structures of different communication disorders in individuals. To do this, you might want to determine if two communication disorder structures are isomorphic using an algorithm like BLISS. The BLISS algorithm can help you identify if the two structures are essentially the same, even if they look different at first glance. Additionally, if the structures are isomorphic, the algorithm can provide the vertex mapping between them, allowing you to better understand the relationship between the two structures and tailor your therapeutic interventions accordingly.
### Response:
import igraph as ig

# Create two graphs

# This is a full graph with 3 vertices
g1 = ig.Graph.Full(3)

# This is a graph with 3 vertices and 3 edges forming a cycle
g2 = ig.Graph([(0, 1), (1, 2), (2, 0)])

# Check if g1 is isomorphic to g2 using the BLISS algorithm
isomorphic, mapping_12, mapping_21 = g1.isomorphic_bliss(g2, return_mapping_12=True, return_mapping_21=True)

# Print if the graphs are isomorphic and the mappings if available
print('Isomorphic:', isomorphic)
if mapping_12 is not None:
  print('Mapping from g1 to g2:', mapping_12)
if mapping_21 is not None:
  print('Mapping from g2 to g1:', mapping_21)
<|EOT|>
