<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (1, 2), (2, 3)], how would you use igraph's Graph.Graph.predecessors to obtain the list of vertices that have edges going into vertex 3?
### Response:
from igraph import Graph

# Initialize a directed graph with edges
edges = [(0, 1), (1, 2), (2, 3)]
g = Graph(edges=edges, directed=True)

# Get the predecessors of vertex 3
predecessors = g.predecessors(3)

# Print the predecessors
print('Predecessors of vertex 3:', predecessors)
<|EOT|>
