<｜begin▁of▁sentence｜>### Instruction:
Given a graph with 5 vertices connected linearly like a chain (0-1-2-3-4), can you find the two vertices that are farthest apart from each other?
### Response:
from igraph import Graph

# Create an igraph instance
graph = Graph(edges=[(0, 1), (1, 2), (2, 3), (3, 4)])

# Get the two vertex IDs whose distance equals the graph's diameter
farthest_v_ids = graph.farthest_points()

# Print the farthest vertex IDs
print('The two vertex IDs with the maximum distance are:', farthest_v_ids)
<|EOT|>
