<｜begin▁of▁sentence｜>### Instruction:
As an energy engineer who designs energy systems for buildings, imagine you are working on a project to optimize the energy efficiency of a complex network of interconnected components within a building. In this scenario, you have a representation of the network using a graph data structure, with the edges corresponding to the connections between the components.  

To determine the adjacent components to a specific component (let's say component 3), you would need to utilize the GraphBase.neighbors function from the Python networkx library to identify all directly connected components to component 3. This information is crucial for analyzing the flow of energy within the network and identifying potential areas for energy optimization and efficiency improvements.
### Response:
from igraph import Graph

# Create an undirected graph
edges = [(0, 1), (0, 2), (1, 3), (2, 3), (3, 4), (4, 5)]
g = Graph(edges=edges)

# Find neighbors of vertex 3
vertex_id = 3
neighbors = g.neighbors(vertex_id)

# Print the neighbors of vertex 3
print('Neighbors of vertex {}:'.format(vertex_id), neighbors)
<|EOT|>
