<｜begin▁of▁sentence｜>### Instruction:
As a Cat Behaviorist, you've been asked to observe the interactions within a group of cats in a multi-cat household. Imagine you have a network of interconnected cat pathways representing how cats move around the house. Now, consider a specific cat, let's call him Whiskers, who tends to lead the pack. Whiskers' movements can be represented by a directed graph where each edge indicates the direction he travels.

Your task is to determine the cats that Whiskers can directly influence or interact with. In other words, using the "successors" method in the CatNetworkX API, you need to find out which cats Whiskers can reach directly from his current position.
### Response:
from igraph import Graph

# Define the edges for the directed graph
edges = [(0, 1), (0, 2), (1, 3), (2, 3), (3, 4)]

# Create the directed graph with the defined edges
g = Graph(edges=edges, directed=True)

# Find the successors for vertex 0
successors = g.successors(0)

# Print the successors of vertex 0
print(successors)
<|EOT|>
