<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges [(0, 1), (0, 2), (1, 3), (2, 4)], how can you find the largest independent vertex sets using igraph?
### Response:
from igraph import Graph

# Create a simple graph with 5 vertices
edges = [(0, 1), (0, 2), (1, 3), (2, 4)]
g = Graph(edges=edges)

# Find the largest independent vertex sets
independent_vertex_sets = g.largest_independent_vertex_sets()

print('Largest independent vertex sets:', independent_vertex_sets)
<|EOT|>
