<｜begin▁of▁sentence｜>### Instruction:
As a networkx expert, you have a deep understanding of graph theory and network analysis. Given a specific graph with an edge set, you may be asked to check for the presence of loop edges within the graph. This could involve utilizing the appropriate function, such as `has_self_loops`, from the networkx library to detect and report any loop edges within the graph.
### Response:
from igraph import Graph

# Define the edges for the graph
edges = [(0, 1), (1, 2), (1, 1)]

# Create the graph with the defined edges
g = Graph(edges=edges)

# Check if there are any loop edges
has_loops = g.is_loop(edges)

# Print whether the graph contains loops
print('Does the graph contain loops?', has_loops)
<|EOT|>
