<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0, 1), (0, 2), (1, 3), (2, 3)], how can you find the successors of vertex 0 using NetworkX?
### Response:
import networkx as nx

# Create a directed graph
dg = nx.DiGraph([(0, 1), (0, 2), (1, 3), (2, 3)])

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