<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph represented by a list of edges, how can you find the successors of a specific vertex using igraph in Python?
### Response:
from igraph import Graph

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

# Get the successors of vertex 0
successors = g.successors(0)
print('Successors of vertex 0:', successors)
<|EOT|>
