<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0, 1), (1, 2), (2, 0), (0, 0), (1, 1), (0, 1)], can you use the is_simple function in igraph to check if the graph is simple (does not have any loops or multiple edges)?
### Response:
from igraph import Graph

# Create a graph with potential loop and multiple edges
g = Graph(edges=[(0, 1), (1, 2), (2, 0), (0, 0), (1, 1), (0, 1)])

# Check if the graph is simple
is_simple_graph = g.is_simple()

# Print result
print('The graph is simple:', is_simple_graph)
<|EOT|>
