<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with vertices ['A', 'B', 'C', 'D'] and edges connecting 'A-B', 'B-C', 'C-D', and 'D-A', how would you find the edge ID for the edge connecting vertices 'B' and 'C' using igraph's get_eid function?
### Response:
from igraph import Graph

# Define the vertices and edges
vertices = ['A', 'B', 'C', 'D']
edges = [('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'A')]

# Create an igraph graph
graph = Graph.TupleList(edges, directed=False)

# Get the edge ID for edge between 'B' and 'C'
ed_id = graph.get_eid('B', 'C')

print('Edge ID between B and C:', ed_id)
<|EOT|>
