<｜begin▁of▁sentence｜>### Instruction:
As a network engineer, you are tasked with designing and managing computer networks and communication systems. You have received a request to use the neighbors function in the igraph library to identify and list the neighbors of vertex 1 in a specific graph, including both successors and predecessors. The graph is defined by the edge set (0, 1), (0, 2), (1, 2), (1, 3). This information will help you analyze the connectivity of the network and determine the relationships between the vertices.
### Response:
from igraph import Graph

# Define the edges of the graph
g = Graph(edges=[(0, 1), (0, 2), (1, 2), (1, 3)])

# Find the neighbors of vertex 1
g_neighbors = g.neighbors(1, mode='all')

# Print the neighbors of vertex 1
print('Neighbors of vertex 1:', g_neighbors)
<|EOT|>
