<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges [(0, 1), (0, 2), (1, 2), (3, 4), (4, 5), (3, 5), (6, 7), (7, 8), (8, 9), (6, 9)], how do you find the vertices reachable from vertex 0 within at most 2 steps using igraph's neighborhood function?
### Response:
from igraph import Graph

# Create an undirected graph with 10 vertices
edges = [(0, 1), (0, 2), (1, 2), (3, 4), (4, 5), (3, 5), (6, 7), (7, 8), (8, 9), (6, 9)]
g = Graph(edges=edges)

# Get the neighborhood of vertex 0 with a maximum order of 2 steps
neighborhood = g.neighborhood(vertices=0, order=2, mindist=0)

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