<｜begin▁of▁sentence｜>### Instruction:
Given a simple graph with edge set [(0, 1), (1, 2), (2, 3), (3, 4), (4, 5)], what is the size of the neighborhood for vertex 1 within 1 step and within 2 steps?
### Response:
from igraph import Graph

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

# Get the size of the neighborhood for vertex 1 within 1 step
neighborhood_size_1 = g.neighborhood_size(vertices=1, order=1)

# Get the size of the neighborhood for vertex 1 within 2 steps
neighborhood_size_2 = g.neighborhood_size(vertices=1, order=2)

print('Neighborhood size within 1 step:', neighborhood_size_1)
print('Neighborhood size within 2 steps:', neighborhood_size_2)
<|EOT|>
