<｜begin▁of▁sentence｜>### Instruction:
As a dance instructor, you may find yourself working with multiple groups of students, each with their own unique choreography. It's important to ensure that no two groups are performing the same routine. Similarly, in graph theory, when working with a graph that has multiple edges between nodes, you might want to determine if a specific edge exists more than once. In this scenario, you can use the `Edge.is_multiple` method in the NetworkX library to check for the existence of duplicate edges between nodes in a graph. This can help you manage and analyze the relationships between different nodes in the graph, just as you would manage and analyze the various dance routines for your students.
### Response:
from igraph import Graph

# Create a simple graph with multiple edges
g = Graph([(0, 1), (1, 2), (2, 0), (0, 1)])  # The edge between 0 and 1 is added twice
e = g.es[0]

# Check if the edge is multiple (meaning if there are multiple edges connecting the same two nodes)
is_mult = e.is_multiple()

print(f'Is the edge {e.tuple} multiple? {is_mult}')
<|EOT|>
