<｜begin▁of▁sentence｜>### Instruction:
Given a graph defined by a set of edges, can you calculate the independence number, which represents the size of the largest independent vertex set?
### Response:
from igraph import Graph

# Construct the graph from edges
g = Graph([(0, 1), (0, 2), (2, 3), (3, 4)])

# Get the independence number of the graph
independence_num = g.independence_number()

# Print the independence number
print(independence_num)
<|EOT|>
