<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges [(0, 1), (0, 2), (1, 3), (2, 3)], can you find and print the neighbors of vertex 0 that are reachable within 1 step?
### Response:
from igraph import Graph

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

# Get the neighborhood of vertex 0 within 1 step
eighborhood = g.neighborhood(vertices=0, order=1)

# Print the neighborhood
print(neighborhood)
<|EOT|>
