<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges [(0, 1), (1, 2), (2, 3), (3, 4), (4, 5), (5, 0)], which two vertex IDs have the largest distance (diameter) from each other?
### Response:
import igraph as ig

# Create an undirected graph with given edges
edges = [(0, 1), (1, 2), (2, 3), (3, 4), (4, 5), (5, 0)]
g = ig.Graph(edges=edges)

# Find the farthest points whose distance equals the actual diameter of the graph
farthest_pts = g.farthest_points()
print(f'The farthest points are: {farthest_pts}')
<|EOT|>
