<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (0, 2), (2, 3), (3, 4)], can you calculate the number of vertices reachable from vertex 0 in at most 2 steps without counting the vertex itself?
### Response:
from igraph import Graph

# Define your graph
edges = [(0, 1), (0, 2), (2, 3), (3, 4)]
g = Graph(edges, directed=True)

# Specify the vertex ID and order
vertex_id = 0
order = 2

# Calculate the neighborhood size
neighborhood_size = g.neighborhood_size(vertices=vertex_id, order=order, mode='out')

# Display the result
print('The neighborhood size of vertex', vertex_id, 'with order', order, 'is:', neighborhood_size)
<|EOT|>
