<｜begin▁of▁sentence｜>### Instruction:
As a supply chain analyst, you are tasked with optimizing the transportation routes for a specific network of warehouses. Given a directed graph representing the warehouse network with 5 locations and the corresponding transportation routes, you need to use the neighborhood function in networkx to identify all the warehouses that can be reached from a specific location within one step. This will help in assessing the efficiency of the transportation routes and planning for timely deliveries.
### Response:
import igraph as ig

# Create a simple directed graph
g = ig.Graph(directed=True)
g.add_vertices(5)
g.add_edges([(0,1), (0,2), (2,3), (3,4), (1,4)])

# Get the neighborhood of vertex 0 within 1 step
g.neighborhood(vertices=0, order=1, mode='out')
<|EOT|>
