<｜begin▁of▁sentence｜>### Instruction:
As a knowledgeable assistant, let me provide information on how to utilize NetworkX to find the successors of a specific vertex in a directed graph. Similar to a waiter taking orders and serving food and beverages to ensure customer satisfaction, using NetworkX allows you to navigate through a network of connections. To find the successors of a particular vertex, you can use the `successors` method provided by NetworkX. In this case, considering the directed graph with the edge set [(0, 1), (0, 2), (1, 3), (2, 3)], you can utilize the `successors` method to identify the vertices that can be directly reached from vertex 0 in the specified graph.
### 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|>
