<｜begin▁of▁sentence｜>### Instruction:
Given a graph with vertices named 'A' and 'B', and edges connecting 'A-B' and 'B-B' (where 'B-B' is a self-loop), can you check if the second edge in the graph (edge 'B-B') is a loop using the 'is_loop' method?
### Response:
from igraph import Graph

# Create an example graph with a self-loop
edges = [(0, 1), (1, 1)] # Notice that (1, 1) is a self-loop
vertices = ['A', 'B']

# Create a simple graph
graph = Graph(edges=edges)

# Using the is_loop method to check if an edge is a loop
is_loop_result = graph.es[1].is_loop()

# Print the result
echo(is_loop_result)
<|EOT|>
